Every 3-connected claw-free graph with domination number at most 3 is Hamiltonian-connected

DOI10.1016/j.disc.2022.112909zbMath1490.05150OpenAlexW4226163530WikidataQ114190526 ScholiaQ114190526MaRDI QIDQ2142647

Leilei Zhang, Xingzhi Zhan, Petr Vrána

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.112909

zbMATH Keywords

claw-free graphHamiltonian-connected graphdomination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Eulerian and Hamiltonian graphs (05C45)

Related Items

The maximum degree of a minimally Hamiltonian-connected graph

Cites Work

• Unnamed Item
• Eulerian subgraphs and Hamilton-connected line graphs
• Dominating sets and Hamiltonicity in \(K_{1,3}\)-free graphs
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Conditions on subgraphs, degrees, and domination for Hamiltonian properties of graphs
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
• On Eulerian and Hamiltonian Graphs and Line Graphs