Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs

DOI10.1002/jgt.20498zbMath1228.05201OpenAlexW2001688290WikidataQ56388857 ScholiaQ56388857MaRDI QIDQ3081311

Zdeněk Ryjáček, Petr Vrána

Publication date: 7 March 2011

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20498

zbMATH Keywords

claw-free graphclosureHamilton-connectedline graph of a multigraph

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45) Vertex degrees (05C07)

Related Items

Hamiltonian line graphs with local degree conditions ⋮ Every 3-connected \(\{K_{1,3},N_{1,2,3}\}\)-free graph is Hamilton-connected ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ On the \(s\)-hamiltonianicity of an hourglass-free line graph ⋮ Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected ⋮ A note on 3-connected hourglass-free claw-free Hamilton-connected graphs ⋮ Polynomially determining spanning connectivity of locally connected line graphs ⋮ On 1-Hamilton-connected claw-free graphs ⋮ Hamilton‐connected {claw,net}‐free graphs, II ⋮ The Hamiltonicity of essentially 9‐connected line graphs ⋮ Hamilton‐connected {claw, bull}‐free graphs ⋮ Hamilton‐connected {claw, net}‐free graphs, I ⋮ Hamilton cycles in 5-connected line graphs ⋮ Closure and Hamilton-connected claw-free hourglass-free graphs ⋮ Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs ⋮ Collapsible graphs and Hamiltonian connectedness of line graphs ⋮ Recent advances on the Hamiltonian problem: survey III ⋮ On \(s\)-Hamiltonicity of net-free line graphs ⋮ On the line graph of a graph with diameter 2 ⋮ How many conjectures can you stand? A survey ⋮ Hamiltonian properties of 3-connected \{claw,hourglass\}-free graphs ⋮ Pancyclicity of 4‐Connected, Claw‐Free, P₁₀‐Free Graphs ⋮ On Forbidden Pairs Implying Hamilton‐Connectedness ⋮ A Closure for 1‐Hamilton‐Connectedness in Claw‐Free Graphs ⋮ Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected ⋮ Characterizing forbidden subgraphs that imply pancyclicity in 4-connected, claw-free graphs ⋮ On \(s\)-Hamiltonian line graphs of claw-free graphs ⋮ Stability of Hereditary Graph Classes Under Closure Operations ⋮ Spanning tree packing and 2-essential edge-connectivity ⋮ Complete family reduction and spanning connectivity in line graphs ⋮ Equivalence of Jackson's and Thomassen's conjectures ⋮ A condition on Hamilton-connected line graphs

Cites Work

• Unnamed Item
• On hamiltonian line graphs and connectivity
• Closure and Hamiltonian-connectivity of claw-free graphs
• 9-connected claw-free graphs are Hamilton-connected
• On a closure concept in claw-free graphs
• On graph closures
• Line graphs and forbidden induced subgraphs
• Graphe représentatif des aretes d'un multigraphe
• Closure and stable Hamiltonian properties in claw-free graphs
• An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
• Reflections on graph theory
• Characterizations of derived graphs
• Hamilton connectivity of line graphs and claw‐free graphs

This page was built for publication: Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs