The number of k-colorings of a graph on a fixed surface

DOI10.1016/J.DISC.2005.04.027zbMATH Open1200.05090DBLPjournals/dm/Thomassen06OpenAlexW2047109885WikidataQ56926684 ScholiaQ56926684MaRDI QIDQ856865FDOQ856865

Authors: Carsten Thomassen 

Publication date: 14 December 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.04.027

Recommendations

• The number of defective colorings of graphs on surfaces
• Color-critical graphs on a fixed surface
• The complexity of some graph colouring problems
• The chromatic number of a graph of girth 5 on a fixed surface
• scientific article; zbMATH DE number 6433827

zbMATH Keywords

chromatic polynomialgraphs on surfaces

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Graph theory
• Graphs on surfaces
• Title not available (Why is that?)
• Every planar graph is 5-choosable
• Color-critical graphs on a fixed surface
• Five-coloring graphs on the torus
• Chromatic Polynomials

Cited In (10)

• The number of defective colorings of graphs on surfaces
• Exponentially many 5-list-colorings of planar graphs
• The chromatic number of a graph of girth 5 on a fixed surface
• The number of colorings of planar graphs with no separating triangles
• (1,k)-Coloring of Graphs with Girth at Least Five on a Surface
• Many 3-colorings of triangle-free planar graphs
• A Five-Color Theorem for Graphs on Surfaces
• Acyclic \(k\)-strong coloring of maps on surfaces
• Estimating the minimal number of colors in acyclic \(k\)-strong colorings of maps on surfaces
• Hyperbolic families and coloring graphs on surfaces

This page was built for publication: The number of \(k\)-colorings of a graph on a fixed surface

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856865)