Premium
Minimum cycle bases of Halin graphs
Author(s) -
Stadler Peter F.
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10111
Subject(s) - mathematics , cycle basis , combinatorics , treewidth , planar graph , pathwidth , 1 planar graph , chordal graph , outerplanar graph , tree depth , graph , discrete mathematics , line graph , graph power
Halin graphs are planar 3‐connected graphs that consist of a tree and a cycle connecting the end vertices of the tree. It is shown that all Halin graphs that are not “necklaces” have a unique minimum cycle basis. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 150–155, 2003