期刊论文

Chen, Guantao

英文

SIAM JOURNAL ON DISCRETE MATHEMATICS

0895-4801

2017

31

4

2429-2439

10.1137/16M1072693

JSPS KAKENHIMinistry of Education, Culture, Sports, Science and Technology, Japan (MEXT)Japan Society for the Promotion of ScienceGrants-in-Aid for Scientific Research (KAKENHI) [25871053, JP16K17646]; JSTERATOJapan Science & Technology Agency (JST) [JPMJER1201]; Sumitomo Foundation; Senshu University; Grants-in-Aid for Scientific ResearchMinistry of Education, Culture, Sports, Science and Technology, Japan (MEXT)Japan Society for the Promotion of ScienceGrants-in-Aid for Scientific Research (KAKENHI) [16K17646] Funding Source: KAKEN

本校为通讯机构

A Halin graph is a plane graph constructed from a planar drawing of a tree by connecting all leaves of the tree with a cycle which passes around the boundary of the graph. The tree must have four or more vertices and no vertices of degree two. Halin graphs have many nice properties such as being Hamiltonian and remaining Hamiltonian after any single vertex deletion. In 1975, Lovász and Plummer conjectured that every 4-connected plane triangulation contains a spanning Halin subgraph. We recently gave a negative answer to this conjecture. In this paper, we construct an infinite class of 5...