论文信息 - Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs

Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász-Plummer Conjecture on Halin Graphs

A \sl Halin graph is a simple plane graph consisting of a tree without degree 2 vertices and a cycle induced by the leaves of the tree. In 1975, Lovasz and Plummer conjectured that every 4-connected plane triangulation has a spanning Halin subgraph. In this paper, we construct an infinite family of counterexamples to the conjecture.

Hikoe Enomoto | Shoichi Tsuchiya | Kenta Ozeki | Guantao Chen

[1] Carsten Thomassen,et al. Graphs with homeomorphically irreducible spanning trees , 1990, J. Graph Theory.

[2] Guantao Chen,et al. Homeomorphically irreducible spanning trees , 2013, J. Comb. Theory, Ser. B.

[3] L. Lovász,et al. On a Family of Planar Bicritical Graphs , 1975 .

[4] Han Ren,et al. Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs , 2012, Comb. Probab. Comput..