Forbidden pairs and the existence of a spanning Halin subgraph

DOI10.1007/s00373-017-1847-7zbMath1376.05035OpenAlexW2755225817MaRDI QIDQ1684949

Guantao Chen, Songling Shan, Shoichi Tsuchiya, Suil O, Jie Han

Publication date: 12 December 2017

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-017-1847-7

zbMATH Keywords

plane graphHalin graphforbidden subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (1)

Characterizing the difference between graph classes defined by forbidden pairs including the claw

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizing forbidden pairs for hamiltonian properties
• A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
• Lengths of cycles in halin graphs
• On a Family of Planar Bicritical Graphs
• Forbidden subgraphs that imply hamiltonian‐connectedness*
• Halin graphs and the travelling salesman problem
• On Forbidden Pairs Implying Hamilton‐Connectedness
• Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs

This page was built for publication: Forbidden pairs and the existence of a spanning Halin subgraph