Bing Wei

Haidong Wu

SIAM J. Discret. Math., June, 2023

2022

Independent bondage number of planar graphs with minimum degree at least 3.

[BibT_eX]

[DOI]

Andrew Pham

Discret. Math., 2022

Gallai-Ramsey numbers for graphs with five vertices and chromatic number four.

[BibT_eX]

[DOI]

Qinghong Zhao

Australas. J Comb., 2022

2021

Long cycles through specified vertices.

[BibT_eX]

[DOI]

Shuchao Li

Xuechao Li

Discret. Math., 2021

Gallai-Ramsey numbers for graphs with chromatic number three.

[BibT_eX]

[DOI]

Qinghong Zhao

Discret. Appl. Math., 2021

2020

A note on Gallai-Ramsey number of even wheels.

[BibT_eX]

[DOI]

Discret. Math., 2020

2019

Independent bondage number of a graph.

[BibT_eX]

[DOI]

Bruce Priddy

Haiying Wang

J. Comb. Optim., 2019

2016

Degree conditions for weakly geodesic pancyclic graphs and their exceptions.

[BibT_eX]

[DOI]

J. Comb. Optim., 2016

Multiplicative Zagreb indices of cacti.

[BibT_eX]

[DOI]

Shaohui Wang

Discret. Math. Algorithms Appl., 2016

2015

Degree Sum Condition for k-ordered Hamiltonian Connected Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2015

Multiplicative Zagreb indices of k-trees.

[BibT_eX]

[DOI]

Shaohui Wang

Discret. Appl. Math., 2015

2014

Sharp bounds of the Zagreb indices of k-trees.

[BibT_eX]

[DOI]

John W. Estes

J. Comb. Optim., 2014

Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees.

[BibT_eX]

[DOI]

Xuechao Li

Discret. Math., 2014

Long Paths containing k-ordered vertices in Graphs.

[BibT_eX]

Ars Comb., 2014

2013

A bound on the values of independence polynomials at -1/<i>k</i>-1/k for <i>k</i>k-degenerate graphs.

[BibT_eX]

[DOI]

John W. Estes

William Staton

Discret. Math., 2013

2012

Independence polynomials of some compound graphs.

[BibT_eX]

[DOI]

Lanzhen Song

William Staton

Discret. Appl. Math., 2012

2011

Sharp bounds for Zagreb indices of maximal outerplanar graphs.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

Cycles in Triangle-Free Graphs.

[BibT_eX]

[DOI]

Xiaojuan Li

Yongjin Zhu

Discret. Math. Algorithms Appl., 2011

2010

Some properties of k-trees.

[BibT_eX]

[DOI]

James M. Shook

Discret. Math., 2010

Independence polynomials of k-tree related graphs.

[BibT_eX]

[DOI]

Lanzhen Song

William Staton

Discret. Appl. Math., 2010

2009

A sufficient condition for pancyclability of graphs.

[BibT_eX]

[DOI]

Evelyne Flandrin

Hao Li

Discret. Math., 2009

2008

Long cycles containing k-ordered vertices in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

On deletions of largest bonds in graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2006

Hamiltonian graphs involving neighborhood unions.

[BibT_eX]

[DOI]

Guantao Chen

Warren E. Shreve

J. Graph Theory, 2006

Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees.

[BibT_eX]

[DOI]

J. Comb. Optim., 2006

Path extendability of claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Hamilton connectivity of line graphs and claw-free graphs.

[BibT_eX]

[DOI]

Zhiquan Hu

J. Graph Theory, 2005

Graph minors and linkages.

[BibT_eX]

[DOI]

Guantao Chen

Ronald J. Gould

Ken-ichi Kawarabayashi

Florian Pfender

J. Graph Theory, 2005

Largest circuits in matroids.

[BibT_eX]

[DOI]

Adv. Appl. Math., 2005

2004

Some remarks on domination.

[BibT_eX]

[DOI]

Dan Archdeacon

Joanna A. Ellis-Monaghan

J. Graph Theory, 2004

Long cycles in triangle-free graphs with prescribed independence number and connectivity.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2004

Independent Cycles in a Bipartite Graph.

[BibT_eX]

Xiangwen Li

Fan Yang

Ars Comb., 2004

2003

Extremal graphs for intersecting cliques.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2003

On Ranks of Matrices Associated with Trees.

[BibT_eX]

[DOI]

Graphs Comb., 2003

Hamilton-connectivity of 3-domination-critical graphs with alpha leq delta.

[BibT_eX]

[DOI]

Yaojun Chen

Discret. Math., 2003

2002

Fan-type theorem for path-connectivity.

[BibT_eX]

[DOI]

J. Graph Theory, 2002

Codiameters of 3-connected 3-domination critical graphs.

[BibT_eX]

[DOI]

Yaojun Chen

J. Graph Theory, 2002

The Chvátal-ErdImages condition for panconnectivity of triangle-free graphs.

[BibT_eX]

[DOI]

Yongjin Zhu

Discret. Math., 2002

Hamilton cycles in 1-tough triangle-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2002

The hamiltonicity of bipartite graphs involving neighborhood unions.

[BibT_eX]

[DOI]

Discret. Math., 2002

2001

Long Cycles through a Linear Forest.

[BibT_eX]

[DOI]

Zhiquan Hu

J. Comb. Theory B, 2001

Long Cycles Passing Through a Specified Edge in 3-Connected Graphs.

[BibT_eX]

[DOI]

Zhiren Sun

Graphs Comb., 2001

Degree Sums, Connectivity and Dominating Cycles in Graphs.

[BibT_eX]

[DOI]

Zhiren Sun

Graphs Comb., 2001

Degree-Light-Free Graphs and Hamiltonian Cycles.

[BibT_eX]

[DOI]

Guantao Chen

Xuerong Zhang

Graphs Comb., 2001

Degree Sums and Path-Factors in Graphs.

[BibT_eX]

[DOI]

Yaojun Chen

Graphs Comb., 2001

A degree condition of 2-factors in bipartite graphs.

[BibT_eX]

[DOI]

Xiangwen Li

Fan Yang

Discret. Appl. Math., 2001

Degree Sequences with Repeated Values.

[BibT_eX]

Ars Comb., 2001

1999

A Short Proof of a Theorem Concerning Degree Sums and Connectivity on Hamiltonian Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

On the Circumferences of Regular 2-Connected Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 1999

Panconnectivity of locally connected claw-free graphs.

[BibT_eX]

[DOI]

Yu Sheng

Discret. Math., 1999

Some properties of 3-domination-critical graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

Hamiltonicity in 3-domination-critical Graphs with alpha = delta + 2.

[BibT_eX]

[DOI]

Lei Zhang

Discret. Appl. Math., 1999

1998

Some new localization theorems on Hamiltonian properties.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

1997

Hamiltonian κ-factors in graphs.

[BibT_eX]

[DOI]

Yongjin Zhu

J. Graph Theory, 1997

Hamiltonicity of 2-connected claw-center independent graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Hamiltonicity of k-connected graphs with independent claws.

[BibT_eX]

Ruqun Shen

Ars Comb., 1997

1996

Hamiltonian cycles in 1-tough graphs.

[BibT_eX]

[DOI]

Graphs Comb., 1996

1993

A generalization of a result of Bauer and Schmeichel.

[BibT_eX]

[DOI]

Graphs Comb., 1993

Hamiltonian paths and hamiltonian connectivity in graphs.

[BibT_eX]

[DOI]