Graphs With 3n−6 Edges Not Containing A Subdivision Of K 5 |
| |
Authors: | Wolfgang Mader |
| |
Affiliation: | 1. Universit?t Hannover, Institut für Mathematik, Welfengarten 1, D-30167, Hannover, Germany
|
| |
Abstract: | We determine all graphs on n ≥ 3 vertices with 3n-6 edges which do not contain a subdivision of K5. These are exactly the graphs which one gets from any number of disjoint maximal planar graphs by successively pasting along triangles. |
| |
Keywords: | 05C83 05C35 |
本文献已被 SpringerLink 等数据库收录! |
|