On the \(s\)-hamiltonianicity of an hourglass-free line graph

DOI10.1016/j.disc.2022.112897zbMath1490.05151OpenAlexW4220772921MaRDI QIDQ2142636

Yang Wu, Ping Li, Hong-Jian Lai, Ai-Mei Yu

Publication date: 27 May 2022

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2022.112897

zbMATH Keywords

line graphpolynomial algorithmfault-tolerant networks\(s\)-Hamiltonian graphhourglass-free graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Graph operations (line graphs, products, etc.) (05C76)

Related Items

On sufficient conditions for Hamiltonicity of graphs, and beyond

Cites Work

• Unnamed Item
• Unnamed Item
• On 1-Hamilton-connected claw-free graphs
• Hamilton cycles in 5-connected line graphs
• On hamiltonian line graphs and connectivity
• On \(s\)-Hamiltonian-connected line graphs
• An \(s\)-Hamiltonian line graph problem
• Edge-connectivity and edge-disjoint spanning trees
• Hamiltonian connectedness in 3-connected line graphs
• Graphs without spanning closed trails
• On a closure concept in claw-free graphs
• All 4-connected line graphs of claw free graphs are Hamiltonian connected
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• Every 4-connected line graph of a quasi claw-free graph is Hamiltonian connected
• On factors of 4-connected claw-free graphs
• Ons-Hamiltonian Line Graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• Hamiltonian results inK1,3-free graphs
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• A reduction method to find spanning Eulerian subgraphs
• Reflections on graph theory
• On Eulerian and Hamiltonian Graphs and Line Graphs