@book{8e0d7086ee1449a98584cb7c8719e12b,

title = "Stars and bunches in planar graphs. Part I: Triangulations",

abstract = "Given a plane graph, a $k$-star at $u$ is a set of $k$ vertices with a common neighbour $u$; and a bunch is a maximal collection of paths of length at most two in the graph, such that all paths have the same end vertices and the edges of the paths form consecutive edges (\,in the natural order in the plane graph\,) around the two end vertices. We prove a theorem on the structure of plane triangulations in terms of stars and bunches. The result states that a plane triangulation contains a $(d-1)$-star centred at a vertex of degree $d\leq5$ and the sum of the degrees of the vertices in the star is bounded, or there exists a large bunch.",

keywords = "MSC-05C12, MSC-05C15",

author = "O.V. Borodin and H.J. Broersma and A. Glebov and {van den Heuvel}, J.",

note = "Imported from MEMORANDA",

year = "2002",

language = "English",

series = "Memorandum",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1632",

}