Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs

DOI10.1007/s10114-012-0459-7zbMath1259.05091OpenAlexW2029731987MaRDI QIDQ1941314

Fang Duan, Guo-Ping Wang

Publication date: 12 March 2013

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-012-0459-7

zbMATH Keywords

Hamiltonian pathlongest path\(\{K_{1,4}, K_{1,4} + e\}\)-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Traceability in $\{K_{1,4},K_{1,4}+e\}$-free graphs

Cites Work

• Hamilton paths in \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Hamiltonicity of \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Hamiltonicity of 2-connected \(\{K_{1,4},K_{1,4}+e\}\)-free graphs
• Longest paths and cycles in K1,3-free graphs
• Some Theorems on Abstract Graphs

This page was built for publication: Note on the longest paths in \(\{ K_{1,4}, K _{1,4 } + e \}\)-free graphs