Choosability and paintability of the lexicographic product of graphs
From MaRDI portal
Publication:2030438
DOI10.1016/j.dam.2017.02.008zbMath1465.05062arXiv1502.03977OpenAlexW2269517134MaRDI QIDQ2030438
Publication date: 7 June 2021
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1502.03977
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- On-line 3-choosable planar graphs
- Mr. Paint and Mrs. Correct go fractional
- Game list colouring of graphs
- Choosability and fractional chromatic numbers
- The chromatic number and other functions of the lexicographic product
- Mr. Paint and Mrs. Correct
- On-line list colouring of graphs
- Flexible color lists in Alon and Tarsi's theorem, and time scheduling with unreliable participants
- Graph colorings with local constraints -- a survey
- Choice Numbers of Graphs: a Probabilistic Approach
This page was built for publication: Choosability and paintability of the lexicographic product of graphs