On hamiltonian line graphs and connectivity
From MaRDI portal
Publication:803154
DOI10.1016/0012-365X(91)90401-MzbMath0727.05037MaRDI QIDQ803154
Publication date: 1991
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Packing spanning trees in highly essentially connected graphs, Every 4-connected line graph of a planar graph is Hamiltonian, Hamiltonian cycles in spanning subgraphs of line graphs, Closure for \(\{K_{1,4},K_{1,4} + e\}\)-free graphs, Hamilton-connectivity of line graphs with application to their detour index, On the \(s\)-hamiltonianicity of an hourglass-free line graph, Claw-free graphs---a survey, On a closure concept in claw-free graphs, Hamiltonicity of 6-connected line graphs, Ore's condition for completely independent spanning trees, Hamilton cycles in 5-connected line graphs, On 3-connected Hamiltonian line graphs, Supereulerian graphs with width \(s\) and \(s\)-collapsible graphs, Collapsible graphs and Hamiltonian connectedness of line graphs, Chvátal-Erdős conditions and almost spanning trails, On \(s\)-Hamiltonicity of net-free line graphs, On the line graph of a graph with diameter 2, Spanning trees: A survey, On 3-edge-connected supereulerian graphs, How many conjectures can you stand? A survey, On \(s\)-Hamiltonian-connected line graphs, On factors of 4-connected claw-free graphs, Every 3-connected essentially 10-connected line graph is Hamilton-connected, Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs, The spanning connectivity of line graphs, What is on his mind?, Locally finite graphs with ends: A topological approach. II: Applications, Toughness in graphs -- a survey, Every 3-connected, essentially 11-connected line graph is Hamiltonian, Hamiltonicity of 3-connected line graphs, Path-comprehensive and vertex-pancyclic properties of super line graph \(\mathcal L_2(G)\), Degree conditions on induced claws, 2-factors with bounded number of components in claw-free graphs, Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected, Collapsible graphs and Hamiltonicity of line graphs, Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs, Spanning even subgraphs of 3‐edge‐connected graphs, On the extended Clark-Wormold Hamiltonian-like index problem, Closure concepts for claw-free graphs, Hamilton cycles in 6-connected claw-free graphs (Extended abstract), Chvátal’s t 0-Tough Conjecture, Spanning tree packing and 2-essential edge-connectivity, Line graphs and forbidden induced subgraphs, All 4-connected line graphs of claw free graphs are Hamiltonian connected, 9-connected claw-free graphs are Hamilton-connected, Ons-Hamiltonian Line Graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Longest cycles in r-regular r-connected graphs
- On the Problem of Decomposing a Graph into n Connected Factors
- Edge-Disjoint Spanning Trees of Finite Graphs
- On hamiltonian line graphs
- Hamiltonian results inK1,3-free graphs
- Hamiltonian line graphs
- Cycles in digraphs– a survey
- On Eulerian and Hamiltonian Graphs and Line Graphs
