Bo Ning

J. Graph Theory, July, 2023

Counting substructures and eigenvalues I: Triangles.

[BibT_eX]

[DOI]

Mingqing Zhai

Eur. J. Comb., May, 2023

Stability of Woodall's Theorem and Spectral Conditions for Large Cycles.

[BibT_eX]

[DOI]

Electron. J. Comb., 2023

2022

Extremal problems of Erdős, Faudree, Schelp and Simonovits on paths and cycles.

[BibT_eX]

[DOI]

Jie Ma

J. Comb. Theory, Ser. B, 2022

Note on Rainbow Triangles in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Xiaozheng Chen

Xueliang Li

Graphs Comb., 2022

Monitoring the edges of product networks using distances.

[BibT_eX]

[DOI]

CoRR, 2022

2021

A complete solution to the Cvetković-Rowlinson conjecture.

[BibT_eX]

[DOI]

Huiqiu Lin

J. Graph Theory, 2021

Exact bipartite Turán numbers of large even cycles.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

A strengthening of Erdős-Gallai Theorem and proof of Woodall's conjecture.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2021

Eigenvalues and triangles in graphs.

[BibT_eX]

[DOI]

Huiqiu Lin

Baoyindureng Wu

Comb. Probab. Comput., 2021

2020

An Ore-type condition for large k -factor and disjoint perfect matchings.

[BibT_eX]

[DOI]

Hongliang Lu

J. Graph Theory, 2020

The formula for Turán number of spanning linear forests.

[BibT_eX]

[DOI]

Jian Wang

Discret. Math., 2020

Maximizing the number of cliques in graphs with given matching number.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Extensions of the Erdős-Gallai theorem and Luo's theorem.

[BibT_eX]

[DOI]

Xing Peng

Comb. Probab. Comput., 2020

Stability Results on the Circumference of a Graph.

[BibT_eX]

[DOI]

Jie Ma

Comb., 2020

2019

The Randić index and signless Laplacian spectral radius of graphs.

[BibT_eX]

[DOI]

Xing Peng

Discret. Math., 2019

On sufficient conditions for rainbow cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2019

2018

Coloring Graphs with Two Odd Cycle Lengths.

[BibT_eX]

[DOI]

Jie Ma

SIAM J. Discret. Math., 2018

Extremal problems on the Hamiltonicity of claw-free graphs.

[BibT_eX]

[DOI]

Xing Peng

Discret. Math., 2018

Modeling and Efficiency Analysis of Clock Glitch Fault Injection Attack.

[BibT_eX]

[DOI]

Qiang Liu

Proceedings of the Asian Hardware Oriented Security and Trust Symposium, 2018

2017

Heavy subgraphs, stability and Hamiltonicity.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

On some papers of Nikiforov.

[BibT_eX]

Ars Comb., 2017

2016

Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Ruonan Li

Graphs Comb., 2016

Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition.

[BibT_eX]

[DOI]

Graphs Comb., 2016

A note on nowhere-zero 3-flows and Z_3-connectivity.

[BibT_eX]

[DOI]

Fuyuan Chen

Ars Math. Contemp., 2016

2015

Notes on a conjecture of Manoussakis concerning Hamilton cycles in digraphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Characterizing Heavy Subgraph Pairs for Pancyclicity.

[BibT_eX]

[DOI]

Graphs Comb., 2015

A note on the number of spanning trees of line digraphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

2014

Rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2014

Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs.

[BibT_eX]

[DOI]

Bing Chen

Discret. Math. Algorithms Appl., 2014

The Ramsey Numbers of Paths Versus Wheels: a Complete Solution.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Pairs of Fan-type heavy subgraphs for pancyclicity of 2-connected graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 2014

2013

Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2013

Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs.

[BibT_eX]

[DOI]