Long antipaths and anticycles in oriented graphs.
Discret. Math., 2025
A Dirac-Type Theorem for Uniform Hypergraphs.
Graphs Comb., August, 2024
Maximal Fractional Cross-Intersecting Families.
Graphs Comb., August, 2023
Some exact results of the generalized Turán numbers for paths.
Eur. J. Comb., May, 2023
The Degree and Codegree Threshold for Linear Triangle Covering in 3-Graphs.
Electron. J. Comb., 2023
Maximizing the number of independent sets of fixed size in K n -covered graphs.
J. Graph Theory, 2022
Strongly Connected Orientation with Minimum Lexicographic Order of Indegrees.
Int. J. Found. Comput. Sci., 2022
A Note on Shortest Sign-Circuit Cover of Signed 3-Edge-Colorable Cubic Graphs.
Graphs Comb., 2022
Rainbow independent sets in graphs with maximum degree two.
Discret. Appl. Math., 2022
An improved probability propagation algorithm for density peak clustering based on natural nearest neighborhood.
Array, 2022
The Turán number for the edge blow-up of trees.
Discret. Math., 2021
Minimizing the number of edges in C≥r-saturated graphs.
Discret. Math., 2021
Minimum degree of 3-graphs without long linear paths.
Discret. Math., 2020
Exact Minimum Codegree Thresholds for $K_4^-$-Covering and $K_5^-$-Covering.
Electron. J. Comb., 2020
Codegree Threshold for Tiling Balanced Complete $3$-Partite $3$-Graphs and Generalized $4$-Cycles.
Electron. J. Comb., 2020
H-Decomposition of r-Graphs when H is an r-Graph with Exactly k Independent Edges.
Graphs Comb., 2019
The size of 3-uniform hypergraphs with given matching number and codegree.
Discret. Math., 2019
Mod (2p+1)-Orientation on Bipartite Graphs and Complementary Graphs.
SIAM J. Discret. Math., 2018
Decomposition of Graphs into (k, r)-Fans and Single Edges.
J. Graph Theory, 2018
Odd Induced Subgraphs in Graphs with Treewidth at Most Two.
Graphs Comb., 2018
The Edge Spectrum of K<sub>4</sub><sup>-</sup>-Saturated Graphs.
Graphs Comb., 2018
Turán number and decomposition number of intersecting odd cycles.
Discret. Math., 2018
A note on broom number and maximum edge-cut of graphs.
Ars Comb., 2017
On Perfect Matching Coverings and Even Subgraph Coverings.
J. Graph Theory, 2016
Extremal Graph for Intersecting Odd Cycles.
Electron. J. Comb., 2016
Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow.
Graphs Comb., 2015
A note on shortest cycle covers of cubic graphs.
J. Graph Theory, 2012
Group connectivity of complementary graphs.
J. Graph Theory, 2012
The total {k}-domatic number of wheels and complete graphs.
J. Comb. Optim., 2012
Z<sub>3</sub>-connectivity of 4-edge-connected 2-triangular graphs.
Eur. J. Comb., 2012
On the Perfect Matchings of Near Regular Graphs.
Graphs Comb., 2011
On the (2, 2)-domination number of trees.
Discuss. Math. Graph Theory, 2010
A characterization of <i>(γ<sub>t</sub>, γ<sub>2</sub>)</i>-trees.
Discuss. Math. Graph Theory, 2010
The forwarding indices of wrapped butterfly networks.
Networks, 2009
On the total {<i>k</i>}-domination number of Cartesian products of graphs.
J. Comb. Optim., 2009
On the {k}-domination number of Cartesian products of graphs.
Discret. Math., 2009
Bounded edge-connectivity and edge-persistence of Cartesian product of graphs.
Discret. Appl. Math., 2009
A Note on the Distance-Balanced Property of Generalized Petersen Graphs.
Electron. J. Comb., 2009
Paired Domination Vertex Critical Graphs.
Graphs Comb., 2008
A characterization of (2gamma, gamma<sub>p</sub>)-trees.
Discret. Math., 2008
On reliability of the folded hypercubes.
Inf. Sci., 2007
Total domination of Cartesian products of graphs.
Discuss. Math. Graph Theory, 2007
Fault diameter of Cartesian product graphs.
Inf. Process. Lett., 2005
Forwarding indices of folded <i>n</i>-cubes.
Discret. Appl. Math., 2005
The proof of a conjecture of Bouabdallah and Sotteau.
Networks, 2004
An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter.
Graphs Comb., 2003