Variable degeneracy on toroidal graphs
From MaRDI portal
Publication:6143693
DOI10.1007/s00373-023-02721-0zbMath1529.05071arXiv1907.07141OpenAlexW2959326801MaRDI QIDQ6143693
No author found.
Publication date: 5 January 2024
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1907.07141
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Coloring signed graphs using DFS
- List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles
- Vertex arboricity of toroidal graphs with a forbidden cycle
- Degree choosable signed graphs
- A sufficient condition for a planar graph to be 4-choosable
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- List colourings of planar graphs
- Choosability in signed planar graphs
- The chromatic number of a signed graph
- The 4-choosability of plane graphs without 4-cycles
- Every planar graph is 5-choosable
- Choosability and edge choosability of planar graphs without five cycles
- A sufficient condition for DP-4-colorability
- Colorings of plane graphs: a survey
- Every planar graph without pairwise adjacent 3-, 4-, and 5-cycle is DP-4-colorable
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
- An analogue of DP-coloring for variable degeneracy and its applications
- Cover and variable degeneracy
- An extension of Thomassen's result on choosability
- A generalization of some results on list coloring and DP-coloring
- DP-degree colorable hypergraphs
- DP-colorings of graphs with high chromatic number
- On list vertex 2-arboricity of toroidal graphs without cycles of specific length
- On the vertex-arboricity of planar graphs
- Planar graphs without triangular 4-cycles are 3-choosable
- The asymptotic behavior of the correspondence chromatic number
- Choosability of toroidal graphs without short cycles
- A list version of Dirac's theorem on the number of edges in colour-critical graphs
- Sharp Dirac's theorem for DP‐critical graphs
- Fractional DP‐colorings of sparse graphs
- The Johansson‐Molloy theorem for DP‐coloring
This page was built for publication: Variable degeneracy on toroidal graphs
