A closure for Hamilton-connectedness in \K₁,3, _3\-free graphs

DOI10.1016/J.DISC.2024.114154MaRDI QIDQ6589131zbMATH OpenFDO

Authors Adam Kabela, Zdeněk Ryjáček, Mária Skyvová, Petr Vrána

Publication date 19 August 2024

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.DISC.2024.114154

zbMATH Keywords

\( \Gamma_3\)-free graphclaw-free graphclosureforbidden subgraphHamilton-connected graph

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Recommendations

• Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected
• Hamilton‐connected {claw, net}‐free graphs, I
• Closure and Hamiltonian-connectivity of claw-free graphs
• Hamilton‐connected {claw,net}‐free graphs, II
• On forbidden pairs implying Hamilton-connectedness

Cites work

• 3-connected \(\{K_{1,3},P_9\}\)-free graphs are Hamiltonian-connected
• A note on Hamiltonian circuits
• A strengthening of Ben Rebea's lemma
• An analogue of the Whithey theorem for edge graphs of multigraphs, and edge multigraphs
• Characterizing forbidden pairs for hamiltonian properties
• Closure and stable Hamiltonian properties in claw-free graphs
• Closure, clique covering and degree conditions for Hamilton-connectedness in claw-free graphs
• Every 3-connected \(\{ K_{1 , 3} , Z_7 \}\)-free graph of order at least 21 is Hamilton-connected
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• Graph theory
• Graphe représentatif des arêtes d'un multigraphe
• Hamilton‐connected {claw,net}‐free graphs, II
• Hamilton‐connected {claw, bull}‐free graphs
• Hamilton‐connected {claw, net}‐free graphs, I
• Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs
• On a closure concept in claw-free graphs
• On stability of Hamilton-connectedness under the 2-closure in claw-free graphs
• Strongly spanning trailable graphs with small circumference and Hamilton-connected claw-free graphs

Cited in

(1)

• Every 3-connected \(\{K_{1, 3}, \Gamma_3\}\)-free graph is Hamilton-connected

Describes a project that uses

Uses Software

• SageMath

This page was built for publication: A closure for Hamilton-connectedness in \(\{K_{1,3}, \Gamma_3\}\)-free graphs

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