On hamiltonian connectedness of \(K_{1,4}\)-free graphs

DOI10.1016/S0012-365X(99)00355-6zbMATH Open0953.05041MaRDI QIDQ1567290

Mingchu Li

Publication date: 23 January 2001

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

zbMATH Keywords

\(K_{1,4}\)-free graphshamiltonian connectednessminimum degrees

Mathematics Subject Classification ID

Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items (1)

On connected \(m\)-\(\mathrm{HPK}(n_1,n_2,n_3,n_4)[K_t]\)-residual graphs

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs 👍 👎
• Hamiltonicity of 4-connected graphs 👍 👎
• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs 👍 👎
• Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path 👍 👎
• Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs 👍 👎
• Highly Hamiltonian \(K_{1,3}P_4\)-free graphs 👍 👎
• Hamiltonicity for K_{1, r}‐free graphs 👍 👎

This page was built for publication: On hamiltonian connectedness of \(K_{1,4}\)-free graphs

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