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)
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers ⋮ List-edge-colouring planar graphs with precoloured edges ⋮ Light structures in infinite planar graphs without the strong isoperimetric property ⋮ The edge-face choosability of plane graphs ⋮ Facial list colourings of plane graphs ⋮ Maximum average degree of list-edge-critical graphs and Vizing's conjecture ⋮ List edge and list total colourings of multigraphs ⋮ Extension from precoloured sets of edges ⋮ Edge DP-coloring in planar graphs ⋮ Planar graphs with $\Delta\geq 8$ are ($\Delta+1$)-edge-choosable ⋮ Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$‐choosable ⋮ Kempe equivalent list edge-colorings of planar graphs ⋮ The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 ⋮ Unnamed Item ⋮ An introduction to the discharging method via graph coloring ⋮ List edge chromatic number of graphs with large girth ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ 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 ⋮ Incidence coloring of \(k\)-degenerated graphs ⋮ Edge choosability of planar graphs without small cycles ⋮ The game coloring number of planar graphs
Cites Work
