Plane Triangulations Without a Spanning Halin Subgraph II

DOI10.1137/16M1072693zbMath1373.05043OpenAlexW2766137238MaRDI QIDQ4588847

Hikoe Enomoto, Guantao Chen, Shoichi Tsuchiya, Kenta Ozeki

Publication date: 2 November 2017

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

Full work available at URL: https://doi.org/10.1137/16m1072693

zbMATH Keywords

plane triangulationHalin graph\(k\)-connected graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Connectivity (05C40)

Related Items (1)

On Rall's 1/2-conjecture on the domination game

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lengths of cycles in halin graphs
• The traveling salesman problem in graphs with 3-edge cutsets
• On a Family of Planar Bicritical Graphs
• Halin graphs and the travelling salesman problem
• Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs
• Minimally 2-connected graphs.

This page was built for publication: Plane Triangulations Without a Spanning Halin Subgraph II