The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
From MaRDI portal
Publication:5048297
DOI10.1137/21M1434556zbMath1503.05046arXiv2110.00906MaRDI QIDQ5048297
Publication date: 15 November 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2110.00906
Games involving graphs (91A43) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steinberg's conjecture is false
- Multiple list colouring of planar graphs
- Mr. Paint and Mrs. Correct go fractional
- Chip games and paintability
- A note on the not 3-choosability of some families of planar graphs
- A non-3-choosable planar graph without cycles of length 4 and 5
- A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable
- On 3-chromatic hypergraphs
- Choosability and fractional chromatic numbers
- A short list color proof of Grötzsch's theorem
- On structure of some plane graphs with application to choosability
- The list chromatic index of a bipartite multigraph
- 3-list-coloring planar graphs of girth 5
- The strong fractional choice number of series-parallel graphs
- Multiple list colouring triangle free planar graphs
- Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable
- Characterization of \((2m,m)\)-paintable graphs
- Bordeaux 3-color conjecture and 3-choosability
- Graph colorings with local constraints -- a survey
- Improved bounds and algorithms for hypergraph 2-coloring
- A 4-choosable graph that is not (8:2)-choosable
This page was built for publication: The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs
