The research of my dissertation is motivated by the conjecture of Thomassen that every 4-connected line graph is hamiltonian and by the conjecture of Tutte that every 4-edge-connected graph has a no-where-zero 3-flow. Towards the hamiltonian line graph problem, we proved that every 3-connected N2-locally connected claw-free graph is hamiltonian, which was conjectured by Ryjacek in 1990; that every 4-connected line graph of an almost claw free graph is hamiltonian connected, and that every triangularly connected claw-free graph G with |E( G)| ≥ 3 is vertex pancyclic. Towards the second conjecture, we proved that every line graph of a 4-edge-connected graph is Z 3-connected
AbstractA conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. I...
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected ...
AbstractA graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved t...
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected ...
AbstractLet G be a graph. For u,v∈V(G) with distG(u,v)=2, denote JG(u,v)={w∈NG(u)∩NG(v)|NG(w)⊆NG(u)∪...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G ...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. ...
AbstractWe investigate graphs G such that the line graph L(G) is hamiltonian connected if and only i...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractKuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimu...
A graph G is k-Hamilton-connected (k-hamiltonian) if G−X is Hamilton-connected (hamiltonian) for eve...
AbstractA graph is claw-free if it contains no induced subgraph isomorphic to a K1,3. This paper stu...
AbstractIfGis a claw-free graph, then there is a graphcl(G) such that (i)Gis a spanning subgraph ofc...
AbstractA conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. I...
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected ...
AbstractA graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a ...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. Here we shall see th...
AbstractThomassen conjectured that every 4-connected line graph is hamiltonian. It has been proved t...
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected ...
AbstractLet G be a graph. For u,v∈V(G) with distG(u,v)=2, denote JG(u,v)={w∈NG(u)∩NG(v)|NG(w)⊆NG(u)∪...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. A vertex cut X of G ...
AbstractThomassen conjectured that every 4-connected line graph is Hamiltonian. Chen and Lai [Z.-H. ...
AbstractWe investigate graphs G such that the line graph L(G) is hamiltonian connected if and only i...
grantor: University of TorontoA graph 'G' is called claw-free if it does not contain a cop...
AbstractKuipers and Veldman conjectured that any 3-connected claw-free graph with order ν and minimu...
A graph G is k-Hamilton-connected (k-hamiltonian) if G−X is Hamilton-connected (hamiltonian) for eve...
AbstractA graph is claw-free if it contains no induced subgraph isomorphic to a K1,3. This paper stu...
AbstractIfGis a claw-free graph, then there is a graphcl(G) such that (i)Gis a spanning subgraph ofc...
AbstractA conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. I...
The research of my dissertation was motivated by the conjecture of Thomassen that every 4-connected ...
AbstractA graph G is quadrangularly connected if for every pair of edges e1 and e2 in E(G), G has a ...