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