List-coloring embedded graphs
From MaRDI portal
Abstract: For any fixed surface Sigma of genus g, we give an algorithm to decide whether a graph G of girth at least five embedded in Sigma is colorable from an assignment of lists of size three in time O(|V(G)|). Furthermore, we can allow a subgraph (of any size) with at most s components to be precolored, at the expense of increasing the time complexity of the algorithm to O(|V(G)|^{K(g+s)+1}) for some absolute constant K; in both cases, the multiplicative constant hidden in the O-notation depends on g and s. This also enables us to find such a coloring when it exists. The idea of the algorithm can be applied to other similar problems, e.g., 5-list-coloring of graphs on surfaces.
Recommendations
- List-colourings of graphs
- List colourings of graphs
- List coloring hypergraphs
- List-distinguishing colorings of graphs
- scientific article; zbMATH DE number 7637228
- Generalized list colouring of graphs
- scientific article; zbMATH DE number 5531976
- Generalized list colourings of graphs
- List coloring of complete multipartite graphs
- On connected list colorings of graphs
Cited in
(11)- List-coloring graphs on surfaces with varying list-sizes
- 3-list-coloring graphs of girth at least five on surfaces
- Coloring near-quadrangulations of the cylinder and the torus
- Hyperbolic families and coloring graphs on surfaces
- List-color-critical graphs on a fixed surface
- List coloring digraphs
- \((3a:a)\)-list-colorability of embedded graphs of girth at least five
- 5-list coloring toroidal 6-regular triangulations in linear time
- Hyperbolicity theorems for correspondence colouring
- On decidability of hyperbolicity
- 5-list coloring toroidal 6-regular triangulations in linear time
This page was built for publication: List-coloring embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5741780)
