5-list coloring toroidal 6-regular triangulations in linear time
From MaRDI portal
Publication:6132529
DOI10.1007/978-3-031-25211-2_10arXiv2106.01634OpenAlexW3168200238MaRDI QIDQ6132529
Brahadeesh Sankarnarayanan, Niranjan Balachandran
Publication date: 17 August 2023
Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.01634
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Five-coloring graphs on the Klein bottle
- The complexity of planar graph choosability
- Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
- Colorings and orientations of graphs
- A solution to a colouring problem of P. Erdős
- Five-coloring graphs on the torus
- Every planar graph is 5-choosable
- Color-critical graphs on a fixed surface
- 4-colorable 6-regular toroidal graphs.
- The list chromatic index of a bipartite multigraph
- The choice number versus the chromatic number for graphs embeddable on orientable surfaces
- Hamiltonian circuits in some maps on the torus
- Construction and enumeration of regular maps on the torus
- Note on 4-coloring 6-regular triangulations on the torus
- Choosability of toroidal graphs without short cycles
- Three-coloring triangle-free planar graphs in linear time
- Filling the complexity gaps for colouring planar and bounded degree graphs
- On Six-Chromatic Toroidal Graphs
- Combinatorial Nullstellensatz
- Hyperbolic families and coloring graphs on surfaces
- 6-Critical Graphs on the Klein Bottle
- List-coloring embedded graphs
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- On the hardness of approximating the chromatic number
- 5-list coloring toroidal 6-regular triangulations in linear time
- The Alon-Tarsi number of a toroidal grid
This page was built for publication: 5-list coloring toroidal 6-regular triangulations in linear time
