Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs
From MaRDI portal
Publication:1173768
DOI10.1007/BF01240258zbMath0742.05039MaRDI QIDQ1173768
Publication date: 25 June 1992
Published in: Mathematical Notes (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C15: Coloring of graphs and hypergraphs
Related Items
Light structures in infinite planar graphs without the strong isoperimetric property, Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof, Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers, Structural properties and edge choosability of planar graphs without 4-cycles, Edge choosability of planar graphs without 5-cycles with a chord, Lightness of digraphs in surfaces and directed game chromatic number, List edge chromatic number of graphs with large girth, The game coloring number of planar graphs, List edge and list total colourings of multigraphs, Incidence coloring of \(k\)-degenerated graphs, Edge choosability of planar graphs without small cycles, The edge-face choosability of plane graphs
Cites Work
