Die Anzahl der Faerbungen ebener Graphen

Simple item page
dc.creatorFriess, L.
dc.date2004-10-13
dc.date.accessioned2026-07-07T05:13:15Z
dc.date.available2026-07-07T05:13:15Z
dc.descriptionLet G be a finite planar connected graph without loops or multiple edges. All minimal circuits except atmost one - say C* - are triangles. Let k be the number of vertices of C*. There are at least 2**(k-3) colorings of the vertices of G with four colors, vertices connected by edges colored differently. These colorings are different on C*.
dc.description98 pages, 35 figures, in german, with large heuristic stuff. Submitted to "Mathematische Annalen" in September 2003. Postscript and PDF available http://www.lorenz-friess.de
dc.identifierhttps://arxiv.org/abs/math/0410319
dc.identifierhttp://arxiv.org/abs/math/0410319
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/72879
dc.subjectCombinatorics
dc.subject05C15
dc.titleDie Anzahl der Faerbungen ebener Graphen
dc.typetext

Files

Collections

arXiv