On the s-hamiltonianicity of an hourglass-free line graph

DOI10.1016/J.DISC.2022.112897MaRDI QIDQ2142636zbMATH OpenOpenAlexFDO

Authors Ping Li, Yang Wu, 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 graphfault-tolerant networkspolynomial algorithm\(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)

Recommendations

• On s-Hamiltonicity of net-free line graphs
• On s-Hamiltonian line graphs
• On \(s\)-Hamiltonian-connected line graphs
• Hamiltonian connected hourglass free line graphs
• An s-Hamiltonian line graph problem
• On \(s\)-Hamiltonian line graphs of claw-free graphs
• scientific article; zbMATH DE number 1094037
• On hamiltonian line graphs of hypergraphs
• On hamiltonian line graphs
• scientific article; zbMATH DE number 68360

Cites work

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

Cited in

(4)

• On s-Hamiltonian line graphs
• Hamiltonian connected hourglass free line graphs
• Every 4-connected \{claw, hourglass\}-free graph is 2-Hamiltonian
• On sufficient conditions for Hamiltonicity of graphs, and beyond

This page was built for publication: On the \(s\)-hamiltonianicity of an hourglass-free line graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2142636)