The choice number versus the chromatic number for graphs embeddable on orientable surfaces
From MaRDI portal
Publication:2121742
DOI10.37236/10263zbMath1486.05101arXiv2102.06993OpenAlexW3131217286MaRDI QIDQ2121742
Niranjan Balachandran, Brahadeesh Sankarnarayanan
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.06993
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items
Note on 4-coloring 6-regular triangulations on the torus, 5-list coloring toroidal 6-regular triangulations in linear time
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- List colourings of planar graphs
- On list critical graphs
- The complexity of planar graph choosability
- Colorings and orientations of graphs
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Five-coloring graphs on the torus
- Every planar graph is 5-choosable
- Uniqueness and faithfulness of embedding of toroidal graphs
- On the choosability of complete multipartite graphs with part size three
- Das Geschlecht des vollständigen paaren Graphen
- Construction and enumeration of regular maps on the torus
- Choice Numbers of Graphs: a Probabilistic Approach
- On chromatic‐choosable graphs
- Hyperbolic families and coloring graphs on surfaces
- Dirac's map-color theorem for choosability
- Extension to 3-Colorable Triangulations
- A Proof of a Conjecture of Ohba
- The last excluded case of Dirac's map‐color theorem for choosability
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Tilings of the Torus and the Klein Bottle and Vertex-Transitive Graphs on a Fixed Surface
- Map-Colour Theorems
- Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen