A Generalization of Kotzig’s Theorem and Its Application

DOI10.1137/050646196zbMath1138.05059OpenAlexW2030292296MaRDI QIDQ5454264

Riste Škrekovski, Łukasz Kowalik, Richard John Cole

Publication date: 28 March 2008

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/050646196

zbMATH Keywords

algorithmplanar graphchoosabilitylight edgelist-coloringKotzig's theorem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

A Planar linear arboricity conjecture ⋮ An extension of Kotzig's theorem ⋮ Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable--a short proof ⋮ Structure of edges in plane graphs with bounded dual edge weight

This page was built for publication: A Generalization of Kotzig’s Theorem and Its Application