Fractional DP-chromatic number of planar graphs of large girth
From MaRDI portal
Publication:5063294
DOI10.1142/S1793830921501111zbMATH Open1482.05124OpenAlexW3135708851MaRDI QIDQ5063294FDOQ5063294
Authors: Jianglin Wu 
Publication date: 17 March 2022
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s1793830921501111
Recommendations
- Girth and fractional chromatic number of planar graphs
- Fractional total colourings of graphs of high girth
- Fractional coloring of triangle-free planar graphs
- Fractional coloring of planar graphs of girth five
- The Fractional Chromatic Number of \(\boldsymbol{K_{\Delta }}\)-Free Graphs
- Fractional Thue chromatic number of graphs
- Fractional chromatic number and circular chromatic number for distance graphs with large clique size
- Total colourings of planar graphs with large girth
- The fractional chromatic number of infinite graphs
- scientific article; zbMATH DE number 5260483
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Choosability and fractional chromatic numbers
- Title not available (Why is that?)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Circular chromatic number of planar graphs of large odd girth
- Fractional DP-colorings of sparse graphs
- List coloring a Cartesian product with a complete bipartite factor
Cited In (1)
This page was built for publication: Fractional DP-chromatic number of planar graphs of large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5063294)
