Liming Xiong

Discret. Appl. Math., 2026

Every 3-Connected Claw-Free Graph of Diameter at Most 3 has a 2-Factor with at Most Two Components.

[BibT_eX]

[DOI]

Lei Zhang

,

Graphs Comb., October, 2025

From matching to integrating: iterative development of business models in China's B2B e-commerce.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Int. J. Technol. Manag., 2025

Characterizing forbidden pairs for the existence of even factors.

[BibT_eX]

[DOI]

Lei Zhang

,

Discret. Math., 2025

Upper bound for the number of maximal dissociation sets in trees.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2025

Disconnected forbidden pairs force supereulerian graphs to be hamiltonian.

[BibT_eX]

[DOI]

Qiang Wang

,

Discret. Math., 2025

Forbidden pairs for 2-factorable and hamiltonian graphs under the necessary condition.

[BibT_eX]

[DOI]

Qiang Wang

,

Discret. Appl. Math., 2025

Forbidden Pairs of disconnected graphs for traceability and hamiltonicity.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

Research problems from the 1st Chinese-Southeasteuropean conference on discrete mathematics and applications.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

Every 2-connected {claw, Z2}-free graph with minimum degree at least 4 contains two CISTs.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2025

Forbidden Pairs for Traceability of 2-Connected Graphs.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2025

Paw-Type Characterization of Hourglass-Free Hamilton-Connected Graphs.

[BibT_eX]

[DOI]

Panpan Wang

,

Axioms, January, 2024

Edge degree conditions for dominating and spanning closed trails.

[BibT_eX]

[DOI]

,

Haitze J. Broersma

,

Discuss. Math. Graph Theory, 2024

Co-Secure Domination Number in Some Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Axioms, 2024

Hamilton-connected properties of 3-connected {claw, hourglass, bull}-free graphs.

[BibT_eX]

[DOI]

Panpan Wang

,

Ars Comb., 2024

Edge-Diameter of a Graph and Its Longest Cycles.

[BibT_eX]

[DOI]

Lei Zhang

,

,

Jianhua Tu

Graphs Comb., August, 2023

Forbidden Pairs for Connected Even Factors in Supereulerian Graphs.

[BibT_eX]

[DOI]

Panpan Wang

,

Graphs Comb., August, 2023

Hamilton-connected {claw,net}-free graphs, II.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, May, 2023

Hamilton-connected {claw, net}-free graphs, I.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2023

Forbidden subgraphs for existences of (connected) 2-factors of a graph.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2023

On the dominating (induced) cycles of iterated line graphs.

[BibT_eX]

[DOI]

Yibin Fang

,

Discret. Appl. Math., 2023

Forbidden Pairs of Disconnected Graphs for Traceability of Block-Chains.

[BibT_eX]

[DOI]

,

,

,

Symmetry, 2022

Forbidden pairs of disconnected graphs for 2-factor of connected graphs.

[BibT_eX]

[DOI]

,

,

,

,

J. Graph Theory, 2022

Hamiltonian extendable graphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2022

Forbidden subgraphs for collapsible graphs and supereulerian graphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2022

Supereulerian line graphs.

[BibT_eX]

[DOI]

Yingmin Shangguan

,

Discret. Math., 2022

A note on 3-connected hourglass-free claw-free Hamilton-connected graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2022

Characterizing forbidden pairs for relative length of longest paths and cycles.

[BibT_eX]

[DOI]

Yibin Fang

,

Discret. Math., 2022

Two completely independent spanning trees of claw-free graphs.

[BibT_eX]

[DOI]

Xiaodong Chen

,

,

Discret. Math., 2022

Edge Degree Conditions for 2-Iterated Line Graphs to Be Traceable.

[BibT_eX]

[DOI]

Yingmin Shangguan

,

Monica Mengyu Wang

,

Axioms, 2022

The Independence Number Conditions for 2-Factors of a Claw-Free Graph.

[BibT_eX]

[DOI]

Wanpeng Lei

,

,

Axioms, 2022

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree.

[BibT_eX]

[DOI]

,

Ziwen Huang

,

Axioms, 2022

Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs.

[BibT_eX]

[DOI]

,

,

Hong-Jian Lai

Graphs Comb., 2021

Circumference of a graph and its distance dominating longest cycles.

[BibT_eX]

[DOI]

Yibin Fang

,

Discret. Math., 2021

Forbidden subgraphs for supereulerian and hamiltonian graphs.

[BibT_eX]

[DOI]

,

,

Discret. Appl. Math., 2021

Forbidden Subgraphs for a Graph to Have a Hamiltonian Path Square.

[BibT_eX]

[DOI]

,

Graphs Comb., 2020

A Note on Singular Edges and Hamiltonicity in Claw-Free Graphs with Locally Disconnected Vertices.

[BibT_eX]

[DOI]

,

Petr Vrána

,

Graphs Comb., 2020

2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices.

[BibT_eX]

[DOI]

Tian Tian

,

Discuss. Math. Graph Theory, 2020

On sufficient degree conditions for traceability of claw-free graphs.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2020

Forbidden subgraphs on Hamiltonian index.

[BibT_eX]

[DOI]

,

Discret. Math., 2020

Forbidden pairs for the matching extendability of graphs with connectivity at least 2 or 3.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2020

Forbidden Pairs for Equality of Connectivity and Edge-Connectivity of Graphs.

[BibT_eX]

[DOI]

,

Shoichi Tsuchiya

,

Graphs Comb., 2019

The Local Structure of Claw-Free Graphs Without Induced Generalized Bulls.

[BibT_eX]

[DOI]

,

Graphs Comb., 2019

Large degree vertices in longest cycles of graphs, II.

[BibT_eX]

[DOI]

Binlong Li

,

,

Electron. J. Graph Theory Appl., 2019

On the independence number of traceable 2-connected claw-free graphs.

[BibT_eX]

[DOI]

,

Discuss. Math. Graph Theory, 2019

Reciprocal degree distance and graph properties.

[BibT_eX]

[DOI]

,

,

,

Discret. Appl. Math., 2019

Spanning Trails in a 2-Connected Graph.

[BibT_eX]

[DOI]

,

Electron. J. Comb., 2019

Number of vertices of degree three in spanning 3-trees in square graphs.

[BibT_eX]

[DOI]

Win Min Aye

,

,

Appl. Math. Comput., 2019

Passing waves from atomistic to continuum.

[BibT_eX]

[DOI]

,

,

,

,

J. Comput. Phys., 2018

Some results on the inverse sum indeg index of a graph.

[BibT_eX]

[DOI]

Mingqiang An

,

Inf. Process. Lett., 2018

Forbidden Subgraphs and Weak Locally Connected Graphs.

[BibT_eX]

[DOI]

,

Houyuan Lin

,

Graphs Comb., 2018

Hamiltonian properties of 3-connected {claw, hourglass}-free graphs.

[BibT_eX]

[DOI]

,

Petr Vrána

,

Discret. Math., 2018

Erratum to "Forbidden pairs for spanning (closed) trails" [Discrete Math. 340 (2017) 1012-1018].

[BibT_eX]

[DOI]

Shengmei Lv

,

Discret. Math., 2018

Pairs of forbidden subgraphs and 2-connected supereulerian graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2018

Traceability on 2-connected line graphs.

[BibT_eX]

[DOI]

,

Appl. Math. Comput., 2018

Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs.

[BibT_eX]

[DOI]

Zhi-Hong Chen

,

Hong-Jian Lai

,

J. Comb. Theory B, 2017

Forbidden set of induced subgraphs for 2-connected supereulerian graphs.

[BibT_eX]

[DOI]

,

Discret. Math., 2017

Forbidden pairs for spanning (closed) trails.

[BibT_eX]

[DOI]

Shengmei Lv

,

Discret. Math., 2017

Forbidden pairs of disconnected graphs for traceability in connected graphs.

[BibT_eX]

[DOI]

,

Binlong Li

,

Discret. Math., 2017

Characterization of forbidden subgraphs for the existence of even factors in a graph.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Connected Even Factors in the Square of Essentially 2-Edge-connected Graph.

[BibT_eX]

[DOI]

Jan Ekstein

,

Baoyindureng Wu

,

Electron. J. Comb., 2017

Extremal polyomino chains with respect to general sum-connectivity index.

[BibT_eX]

Mingqiang An

,

Ars Comb., 2017

Maximally edge-connected graphs and Zeroth-order general Randić index for α ≤ -1.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2016

Extremal polyomino chains with respect to general Randić index.

[BibT_eX]

[DOI]

Mingqiang An

,

J. Comb. Optim., 2016

Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles.

[BibT_eX]

[DOI]

,

,

Haixing Zhao

Graphs Comb., 2016

The Ryjáček closure and a forbidden subgraph.

[BibT_eX]

[DOI]

Akira Saito

,

Discuss. Math. Graph Theory, 2016

Large degree vertices in longest cycles of graphs, I.

[BibT_eX]

[DOI]

Binlong Li

,

,

Discuss. Math. Graph Theory, 2016

Some results on the reciprocal sum-degree distance of graphs.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Optim., 2015

The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2015

On Traceable Line Graphs.

[BibT_eX]

[DOI]

,

Graphs Comb., 2015

An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2015

Hamiltonian claw-free graphs with locally disconnected vertices.

[BibT_eX]

[DOI]

,

Discret. Math., 2015

A coherent phonon pulse model for transient phonon thermal transport.

[BibT_eX]

[DOI]

Xiang Chen

,

Aleksandr Chernatynskiy

,

,

Youping Chen

Comput. Phys. Commun., 2015

Branch-bonds, two-factors in iterated line graphs and circuits in weighted graphs.

[BibT_eX]

[DOI]

Qingning Wang

,

Int. J. Comput. Math., 2014

On Hamiltonicity of 3-Connected Claw-Free Graphs.

[BibT_eX]

[DOI]

,

,

Graphs Comb., 2014

Induced hourglass and the equivalence between hamiltonicity and supereulerianity in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2014

On extremal k-supereulerian graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2014

Maximally edge-connected graphs and Zeroth-order general Randić index for 0<α<1.

[BibT_eX]

[DOI]

Guifu Su

,

,

Xiaofeng Su

Discret. Appl. Math., 2014

Nordhaus-Gaddum-type inequality for the hyper-Wiener index of graphs when decomposing into three parts.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2013

Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs.

[BibT_eX]

[DOI]

,

,

,

,

Graphs Comb., 2013

On the Co-PI and Laplacian Co-PI eigenvalues of a graph.

[BibT_eX]

[DOI]

Guifu Su

,

,

Lan Xu

Discret. Appl. Math., 2013

On 2-factors in claw-free graphs whose edges are in small cycles.

[BibT_eX]

[DOI]

,

,

Discret. Math., 2012

Spanning subgraph with Eulerian components.

[BibT_eX]

[DOI]

,

Hong-Jian Lai

,

Discret. Math., 2012

Star subdivisions and connected even factors in the square of a graph.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2012

Hamiltonicity of 3-connected line graphs.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2012

The Nordhaus-Gaddum-type inequalities for the Zagreb index and co-index of graphs.

[BibT_eX]

[DOI]

Guifu Su

,

,

Lan Xu

Appl. Math. Lett., 2012

Closure operation for even factors on claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2011

Hamiltonian index is NP-complete.

[BibT_eX]

[DOI]

,

Gerhard J. Woeginger

,

Discret. Appl. Math., 2011

2-factors with the bounded number of components in line graphs.

[BibT_eX]

[DOI]

Appl. Math. Lett., 2011

Every 3-connected claw-free Z8-free graph is Hamiltonian.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2010

Closure concept for 2-factors in claw-free graphs.

[BibT_eX]

[DOI]

,

,

Kiyoshi Yoshimoto

Discret. Math., 2010

The Chvátal-Erdös condition for supereulerian graphs and the Hamiltonian index.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2010

Supereulerianity of k-edge-connected graphs with a restriction on small bonds.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2010

Supereulerian index is stable under contractions and closures.

[BibT_eX]

,

Ars Comb., 2010

Spanning eulerian subgraphs in N2-locally connected claw-free graphs.

[BibT_eX]

,

,

,

Ars Comb., 2010

Even factor of a graph with a bounded number of components.

[BibT_eX]

[DOI]

,

Australas. J Comb., 2010

Traceability of line graphs.

[BibT_eX]

[DOI]

,

Minmin Zong

Discret. Math., 2009

The structure of even factors in claw-free graphs.

[BibT_eX]

[DOI]

,

Mei Lu

,

Longsheng Han

Discret. Math., 2009

Closure, stability and iterated line graphs with a 2-factor.

[BibT_eX]

[DOI]

Akira Saito

,

Discret. Math., 2009

Circumferences and minimum degrees in 3-connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

,

Discret. Math., 2009

On distance local connectivity and the hamiltonian index.

[BibT_eX]

[DOI]

Premysl Holub

,

Discret. Math., 2009

Hamilton-connected indices of graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2009

Radius and subpancyclicity in line graphs.

[BibT_eX]

[DOI]

,

Qiuxin Wu

,

Discret. Math., 2008

The hamiltonian index of a 2-connected graph.

[BibT_eX]

[DOI]

,

Qiuxin Wu

Discret. Math., 2008

The existence of even factors in iterated line graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

Connected even factors in claw-free graphs.

[BibT_eX]

[DOI]

,

,

Haitze J. Broersma

Discret. Math., 2008

The upper bound of the number of cycles in a 2-factor of a line graph.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2007

On the 2-factor index of a graph.

[BibT_eX]

[DOI]

,

Discret. Math., 2007

Quadrangularly connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

,

Discret. Math., 2007

Toughness and hamiltonicity in k-trees.

[BibT_eX]

[DOI]

,

,

Kiyoshi Yoshimoto

Discret. Math., 2007

Subpancyclicity of line graphs and degree sums along paths.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2006

On stability of the hamiltonian index under contractions and closures.

[BibT_eX]

[DOI]

,

,

J. Graph Theory, 2005

Hourglasses and Hamilton cycles in 4-connected claw-free graphs.

[BibT_eX]

[DOI]

,

,

,

J. Graph Theory, 2005

A Note on the Shortness Coefficient and the Hamiltonicity of 4-Connected Line Graphs.

[BibT_eX]

[DOI]

,

Roman Kuzel

Graphs Comb., 2005

Circumferences and Minimum Degrees in 3-Connected Claw-Free Graphs.

[BibT_eX]

[DOI]

,

Electron. Notes Discret. Math., 2005

The hamiltonian index of a graph and its branch-bonds.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2004

Hamiltonian iterated line graphs.

[BibT_eX]

[DOI]

,

Zhanhong Liu

Discret. Math., 2002

Degree sums and subpancyclicity in line graphs.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2002

A note on minimum degree conditions for supereulerian graphs.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2002

The Hamiltonian Index of a Graph.

[BibT_eX]

[DOI]

Graphs Comb., 2001

On subpancyclic line graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1998

Edge degree conditions for subpancyclicity in line graphs.

[BibT_eX]

[DOI]