WorldCat Identities

Li, Hao

Overview
Works: 18 works in 22 publications in 2 languages and 51 library holdings
Roles: Author, Opponent
Publication Timeline
.
Most widely held works by Hao Li
Shortest walks in almost claw-free graphs by O Favaron( Book )
2 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Strong edge colorings of graphs by O Favaron( Book )
3 editions published in 1993 in English and held by 4 WorldCat member libraries worldwide
Some results on K(r)-covered graphs by O Favaron( Book )
2 editions published in 1996 in English and held by 4 WorldCat member libraries worldwide
A note on hamiltonian claw-free graphs by Hao Li( Book )
1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide
On the Loebl-Komlós-Sós conjecture by Cristina Bazgan( Book )
1 edition published in 1997 in English and held by 3 WorldCat member libraries worldwide
A note on flowers in graphs by Hao Li( Book )
1 edition published in 1995 in English and held by 3 WorldCat member libraries worldwide
An ore-type condition for pancyclability by O Favaron( Book )
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
On the vertex-distinguishing proper edge-colorings of graphs by C Bazgan( Book )
1 edition published in 1997 in English and held by 3 WorldCat member libraries worldwide
(D, m)-Dominating numbers of m-connected graphs by Hao Li( Book )
1 edition published in 1997 in English and held by 3 WorldCat member libraries worldwide
Degree sums, claws and hamiltonicity by Hao Li( Book )
1 edition published in 1994 in English and held by 3 WorldCat member libraries worldwide
Hamilton cycles in 2-connected regular bipartite graphs by Bill Jackson( Book )
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
Hamiltonian cycles in 2-connected claw free graphs with at most 5d-5 vertices ( Book )
1 edition published in 1996 in English and held by 3 WorldCat member libraries worldwide
Hamiltonicity in 2-connected graphs with claws by Hao Li( Book )
1 edition published in 1993 in English and held by 3 WorldCat member libraries worldwide
(2,k)-Factor-critical graphs and toughness by Mao-cheng Cai( Book )
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
Rapport scientifique présenté pour l'obtention d'une habilitation à diriger des recherches by Hao Li( Book )
1 edition published in 1993 in French and held by 2 WorldCat member libraries worldwide
Distance-dominating cycles in quasi-claw-free graphs by Chuanping Chen( Book )
1 edition published in 1996 in English and held by 2 WorldCat member libraries worldwide
On the cyclability of graphs by O Favaron( Book )
1 edition published in 1993 in English and held by 2 WorldCat member libraries worldwide
Abstract: "A subset S of vertices of a graph G is called cyclable if there is in G some cycle containing all the vertices of S. We give two results on the cyclability of graphs, one of which is related to the 'hamiltonian-nice-sequence' conditions and the other of which is related to the 'claw-free' conditions. They imply many known results on hamiltonian graph theory."
Proper and weak-proper trees in edges-colored graphs and multigraphs by Valentin Borozan( )
1 edition published in 2011 in English and held by 1 WorldCat member library worldwide
In this thesis, we investigate the extraction of trees from edge-colored graphs. We focus on finding trees with properties based on coloring. Namely, we deal with proper and weak proper spanning trees, denoted PST and WST.- We show the optimization versions of these problems to be NP-hard in the general case of edge-colored graphs and we provide algorithms to find these trees in the case of edge-colored graphs without properly edge-colored cycles. We also provide some nonapproximability bounds.- We investigate the existence of a PST in the case of edge-colored graphs under certain conditions on the graph, both structural and related to the coloration. We consider sufficient conditions that guarantee the existence of a PST in edge-colored (not necessarily proper) graphs with any number of colors. The conditions we consider are combinations ofvarious parameters such as : total number of colors, number of vertices, connectivity and the number of incident edges of different colors to the vertices.- We then consider properly edge-colored Hamiltonian paths in the edge-colored multigraphs, which are relevant to our study since they are also PST. We establish sufficient conditions for a multigraph to contain a proper edge-colored Hamiltonian path, depending on several parameters such as the number of edges, the degree of edges, etc.- Since one of the sufficient conditions for the existence of proper spanning trees is connectivity, we prove several upper bounds for the smallest number of colors needed to color a graph such that it is k-proper-connected. We state several conjectures for general and bipartite graphs, and we prove them for k = 1
 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.46 (from 0.00 for Proper and ... to 0.47 for Shortest w ...)
Languages
English (21)
French (1)