On triangle-free list assignments
From MaRDI portal
Publication:6184549
DOI10.1016/j.disc.2023.113779arXiv2203.02980MaRDI QIDQ6184549
Publication date: 25 January 2024
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2203.02980
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Nonrepetitive colouring via entropy compression
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Covering the vertex set of a graph with subgraphs of smaller degree
- A bound on the chromatic number of a graph
- Chromatic number, girth and maximal degree
- Coloring graphs with sparse neighborhoods
- The list chromatic number of graphs with small clique number
- Asymptotically the list colouring constants are 1
- The list chromatic index of a bipartite multigraph
- Colorings of plane graphs: a survey
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- Distributed coloring algorithms for triangle-free graphs
- Acyclic edge-coloring using entropy compression
- The asymptotic behavior of the correspondence chromatic number
- A Note on Vertex List Colouring
- List Colouring Constants of Triangle Free Graphs
- A constructive proof of the general lovász local lemma
- Randomized Distributed Edge Coloring via an Extension of the Chernoff--Hoeffding Bounds
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- Focused Stochastic Local Search and the Lovász Local Lemma
- On a list coloring conjecture of Reed
- On the independence number of sparse graphs
- On Brooks' Theorem for Sparse Graphs
- New approach to nonrepetitive sequences
- A constructive proof of the Lovász local lemma
- The Johansson‐Molloy theorem for DP‐coloring
- Harmonious coloring of uniform hypergraphs
- SOME UNSOLVED PROBLEMS IN GRAPH THEORY
- Independent transversals in bipartite correspondence-covers
- Graph colouring and the probabilistic method
- Asymptotically good edge correspondence colourings
This page was built for publication: On triangle-free list assignments
