Hamiltonicity of 2-connected \K₁,4,K₁,4+e\-free graphs

DOI10.1016/J.DISC.2004.05.014zbMATH Open1052.05505OpenAlexW1991503694MaRDI QIDQ1886342FDOQ1886342

Authors: Rao Li 

Publication date: 18 November 2004

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

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

zbMATH Keywords

Hamiltonicity

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Graph theory with applications
• Dominating cycles in regular 3-connected graphs
• Title not available (Why is that?)
• Hamiltonicity for K_{1, r}‐free graphs
• Hamiltonian cycles in 2‐connected claw‐free‐graphs

Cited In (6)

• Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs
• Perfect matchings in graphs with prescribed local restrictions
• Perfect matchings and \(K_{1,p}\)-restricted graphs
• Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs
• On hamiltonian connectedness of \(K_{1,4}\)-free graphs
• Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs

This page was built for publication: Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs

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