k-Chromatic Number of Graphs on Surfaces
From MaRDI portal
Publication:5189531
DOI10.1137/070688262zbMATH Open1200.05079OpenAlexW2033247133MaRDI QIDQ5189531
Riste Škrekovski, Zdeněk Dvořák
Publication date: 17 March 2010
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/070688262
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items (6)
A lower bound for the one-chromatic number of a surface ⋮ (1,k)-Coloring of Graphs with Girth at Least Five on a Surface ⋮ The bounded chromatic number for graphs of genus \(g\) ⋮ Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces ⋮ The distinguishing numbers of graphs on closed surfaces ⋮ Acyclic \(k\)-strong coloring of maps on surfaces
This page was built for publication: k-Chromatic Number of Graphs on Surfaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189531)
