Geodesic
Hamilton cycles in split graphs with large minimum degree
Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 23-40

Voir la notice de l'article provenant de la source Library of Science

A graph G is called a split graph if the vertex-set V of G can be partitioned into two subsets V₁ and V₂ such that the subgraphs of G induced by V₁ and V₂ are empty and complete, respectively. In this paper, we characterize hamiltonian graphs in the class of split graphs with minimum degree δ at least |V₁| - 2.
Keywords: Hamilton cycle, split graph, bipartite graph 
@article{DMGT_2004_24_1_a1,
     author = {Tan, Ngo and Hung, Le},
     title = {Hamilton cycles in split graphs with large minimum degree},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {23--40},
     publisher = {mathdoc},
     volume = {24},
     number = {1},
     year = {2004},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a1/}
}
TY  - JOUR
AU  - Tan, Ngo
AU  - Hung, Le
TI  - Hamilton cycles in split graphs with large minimum degree
JO  - Discussiones Mathematicae. Graph Theory
PY  - 2004
SP  - 23
EP  - 40
VL  - 24
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a1/
LA  - en
ID  - DMGT_2004_24_1_a1
ER  - 
%0 Journal Article
%A Tan, Ngo
%A Hung, Le
%T Hamilton cycles in split graphs with large minimum degree
%J Discussiones Mathematicae. Graph Theory
%D 2004
%P 23-40
%V 24
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a1/
%G en
%F DMGT_2004_24_1_a1
Tan, Ngo; Hung, Le. Hamilton cycles in split graphs with large minimum degree. Discussiones Mathematicae. Graph Theory, Tome 24 (2004) no. 1, pp. 23-40. http://geodesic.mathdoc.fr/item/DMGT_2004_24_1_a1/