Hao Li

Shun-ichi Maezawa

J. Comb. Optim., 2022

Integer colorings with no rainbow k-term arithmetic progression.

[BibT_eX]

[DOI]

Wenling Zhou

Eur. J. Comb., 2022

2021

The generalized measure of edge fault tolerance in exchanged crossed cube.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

Vertex-disjoint stars in K1, r-free graphs.

[BibT_eX]

[DOI]

Suyun Jiang

Jin Yan

Discret. Appl. Math., 2021

2020

Vertex-disjoint rainbow triangles in edge-colored graphs.

[BibT_eX]

[DOI]

Jie Hu

Donglei Yang

Discret. Math., 2020

Locating any two vertices on Hamiltonian cycles in large graphs.

[BibT_eX]

[DOI]

Weihua He

Qiang Sun

Discret. Math., 2020

2018

Decompositions of graphs into cycles with chords.

[BibT_eX]

[DOI]

Paul Balister

Richard H. Schelp

J. Comb. Theory, Ser. B, 2018

An implicit degree condition for k-connected 2-heavy graphs to be hamiltonian.

[BibT_eX]

[DOI]

Yuzhong Zhang

Inf. Process. Lett., 2018

The isolated-pentagon rule and nice substructures in fullerenes.

[BibT_eX]

[DOI]

Heping Zhang

Ars Math. Contemp., 2018

2017

A note on neighbor expanded sum distinguishing index.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2017

Longest cycles in 4-connected graphs.

[BibT_eX]

[DOI]

Qiang Sun

Discret. Math., 2017

Bondage number of the strong product of two trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On the minimum Kirchhoff index of graphs with a given vertex k-partiteness and edge k-partiteness.

[BibT_eX]

[DOI]

Weihua He

Shuofa Xiao

Appl. Math. Comput., 2017

2016

A Note on Edge-Disjoint Hamilton Cycles in Line Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Hamilton Cycles in Implicit 2-Heavy Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2016

Universal arcs in tournaments.

[BibT_eX]

[DOI]

Discret. Math., 2016

Hamiltonian cycles in spanning subgraphs of line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Vertex-distinguishing proper arc colorings of digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Locating sets of vertices on Hamiltonian cycles.

[BibT_eX]

[DOI]

Ralph J. Faudree

Kiyoshi Yoshimoto

Discret. Appl. Math., 2016

2015

Vertex-disjoint cycles in bipartite tournaments.

[BibT_eX]

[DOI]

Yandong Bai

Binlong Li

Discret. Math., 2015

2014

Adaptive Fault-Tolerant Routing in 2D Mesh with Cracky Rectangular Model.

[BibT_eX]

[DOI]

J. Appl. Math., 2014

An implicit weighted degree condition for heavy cycles.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2014

Complementary cycles in regular bipartite tournaments.

[BibT_eX]

[DOI]

Yandong Bai

Weihua He

Discret. Math., 2014

A new sufficient condition for pancyclability of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

2013

Data forwarding of realtime mobile target tracking in wireless sensor networks.

[BibT_eX]

[DOI]

Yi Yang

Lian Li

J. Ambient Intell. Humaniz. Comput., 2013

An Implicit Degree Condition for Pancyclicity of Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2013

Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey.

[BibT_eX]

[DOI]

Discret. Math., 2013

Rainbow C3's and c4's in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2013

An implicit degree condition for hamiltonian cycles.

[BibT_eX]

Ars Comb., 2013

2012

A Note on Heterochromatic C 4 in Edge-Colored Triangle-Free Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2012

Color degree and heterochromatic cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

An implicit degree condition for hamiltonian graphs.

[BibT_eX]

[DOI]

Discret. Math., 2012

Locating pairs of vertices on Hamiltonian cycles.

[BibT_eX]

[DOI]

Ralph J. Faudree

Discret. Math., 2012

The Maximum Number of Triangles in C2k+1-Free Graphs.

[BibT_eX]

[DOI]

Ervin Györi

Comb. Probab. Comput., 2012

2011

An Implicit Degree Condition for Cyclability in Graphs.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2011

2010

Algorithm for two disjoint long paths in 2-connected graphs.

[BibT_eX]

[DOI]

Shan Zhou

Theor. Comput. Sci., 2010

The k-dominating cycles in graphs.

[BibT_eX]

[DOI]

Shan Zhou

Eur. J. Comb., 2010

Cyclability in k-connected K1, 4-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2010

A note on graphs containing all trees of a given size.

[BibT_eX]

Ars Comb., 2010

2009

Color degree and alternating cycles in edge-colored graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

A sufficient condition for pancyclability of graphs.

[BibT_eX]

[DOI]

Bing Wei

Discret. Math., 2009

Hamiltonicity and pancyclicity of cartesian products of graphs.

[BibT_eX]

[DOI]

Roman Cada

Discret. Math., 2009

The heterochromatic matchings in edge-colored bipartite graphs.

[BibT_eX]

Ars Comb., 2009

2008

Neighborhood unions and extremal spanning trees.

[BibT_eX]

[DOI]

Discret. Math., 2008

Heterochromatic Matchings in Edge-Colored Graphs.

[BibT_eX]

[DOI]

Electron. J. Comb., 2008

2007

A Note on k -walks in Bridgeless Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2007

A sufficient condition for cyclability in directed graphs.

[BibT_eX]

[DOI]

Jinlong Shu

Discret. Math., 2007

A Chvátal-Erdos type condition for pancyclability.

[BibT_eX]

[DOI]

Discret. Math., 2007

A generalization of Dirac's theorem on cycles through k vertices in k-connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Long Alternating Cycles in Edge-Colored Complete Graphs.

[BibT_eX]

[DOI]

Shan Zhou

Proceedings of the Frontiers in Algorithmics, First Annual International Workshop, 2007

2006

Hamiltonicity and pancyclicity of generalized prisms.

[BibT_eX]

[DOI]

Roman Cada

Electron. Notes Discret. Math., 2006

Chvátal-Erdös condition and pancyclism.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2006

2005

A Note on a Generalisation of Ore's Condition.

[BibT_eX]

[DOI]

Graphs Comb., 2005

The partition of a strong tournament.

[BibT_eX]

[DOI]

Jinlong Shu

Discret. Math., 2005

2004

Balanced edge colorings.

[BibT_eX]

[DOI]

Paul N. Balister

Alexandr V. Kostochka

Richard H. Schelp

J. Comb. Theory, Ser. B, 2004

A note on pancyclism of highly connected graphs.

[BibT_eX]

[DOI]

Discret. Math., 2004

Partition of a graph into cycles and degenerated cycles.

[BibT_eX]

[DOI]

Hikoe Enomoto

Discret. Math., 2004

Cycles through given vertices and closures.

[BibT_eX]

[DOI]

Discret. Math., 2004

Partitioning a strong tournament into k cycles.

[BibT_eX]

Jinlong Shu

Ars Comb., 2004

2003

Two-factors each component of which contains a specified vertex.

[BibT_eX]

[DOI]

J. Graph Theory, 2003

2001

Partitioning vertices of 1-tough graphs into paths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2001

Partitioning Vertices of a Tournament into Independent Cycles.

[BibT_eX]

[DOI]

Guantao Chen

Ronald J. Gould

J. Comb. Theory, Ser. B, 2001

A note on a new condition implying pancyclism.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2001

Clique covering and degree conditions for hamiltonicity in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

On quasifactorability in graphs.

[BibT_eX]

[DOI]

Mao-cheng Cai

Discret. Math., 2001

A note on the vertex-distinguishing proper coloring of graphs with large minimum degree.

[BibT_eX]

[DOI]

Discret. Math., 2001

2000

Cyclability of 3-connected graphs.

[BibT_eX]

[DOI]

Feng Tian

J. Graph Theory, 2000

On the Loebl-Komlós-Sós conjecture.

[BibT_eX]

[DOI]

J. Graph Theory, 2000

1999

On the Vertex-Distinguishing Proper Edge-Colorings of Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1999

Distance-Dominating Cycles in Quasi Claw-Free Graphs.

[BibT_eX]

[DOI]

Chuanping Chen

Graphs Comb., 1999

(2, k)-Factor-Critical Graphs and Toughness.

[BibT_eX]

[DOI]

Mao-cheng Cai

Odile Favaron

Graphs Comb., 1999

An Ore-type condition for pancyclability.

[BibT_eX]

[DOI]

Discret. Math., 1999

On 2-factors in claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1999

1998

Hamiltonicity in 2-connected graphs with claws.

[BibT_eX]

[DOI]

Mei Lu

Zhiren Sun

Discret. Math., 1998

Global insertion and hamiltonicity in DCT-graphs.

[BibT_eX]

[DOI]

Ahmed Ainouche

Odile Favaron

Mohamed El Kadi Abderrezzak

Discret. Math., 1998

1997

Hamiltonicity of 2-connected claw-center independent graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

Cycles through subsets with large degree sums.

[BibT_eX]

[DOI]

Discret. Math., 1997

Dlambda-cycles in lambda-claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1997

1996

Sequences, claws and cyclability of graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Pancyclism and small cycles in graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 1996

Strong edge colorings of graphs.

[BibT_eX]

[DOI]

Odile Favaron

Richard H. Schelp

Discret. Math., 1996

Shortest walks in almost claw-free graphs.

[BibT_eX]

Ars Comb., 1996

1995

Dominating cycles in bipartite biclaw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 1995

1994

Mengerian properties, hamiltonicity, and claw-free graphs.

[BibT_eX]

[DOI]

Networks, 1994

Hamiltonicity of Bipartite Biclaw-free Graphs.

[BibT_eX]

[DOI]

Jean-Luc Fouquet

Discret. Appl. Math., 1994

1993

The complete closure of a graph.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

On hamiltonian claw-free graphs.

[BibT_eX]

[DOI]

Jean-Luc Fouquet

Discret. Math., 1993

1991

Hamiltonism, degree sum and neighborhood intersections.

[BibT_eX]

[DOI]

Heinz Adolf Jung