On Brooks' Theorem for Sparse Graphs
From MaRDI portal
Publication:4852428
Recommendations
- The list chromatic number of graphs with small clique number
- A new upper bound for the list chromatic number
- List edge chromatic number of graphs with large girth
- Colouring graphs with sparse neighbourhoods: bounds and applications
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
Cites work
- A bound on the chromatic number of a graph
- A dense infinite Sidon sequence
- A Lower Bound for Heilbronn'S Problem
- A note on Ramsey numbers
- A note on the independence number of triangle-free graphs
- A note on the independence number of triangle-free graphs. II
- Asymptotic behavior of the chromatic index for hypergraphs
- Asymptotic lower bounds for Ramsey functions
- Chromatic number, girth and maximal degree
- Covering the vertex set of a graph with subgraphs of smaller degree
- Matchings and covers in hypergraphs
- Near perfect coverings in graphs and hypergraphs
- On a packing and covering problem
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
Cited in
(49)- A new upper bound for the list chromatic number
- Fractional v. integral covers in hypergraphs of bounded edge size
- Tail bound for the minimal spanning tree of a complete graph.
- The list chromatic number of graphs with small clique number
- Torpid mixing of the Wang-Swendsen-Kotecký algorithm for sampling colorings
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques
- Measurable versions of the Lovász local lemma and measurable graph colorings
- Distributed coloring algorithms for triangle-free graphs
- On coupon colorings of graphs
- Probabilistic constructions in generalized quadrangles
- Brooks' theorem on powers of graphs
- The \(m\)-degenerate chromatic number of a digraph
- New upper bounds for the chromatic number of a graph
- Waiter-Client and Client-Waiter planarity, colorability and minor games
- Coloring sparse hypergraphs
- Coloring H-free hypergraphs
- List coloring triangle-free hypergraphs
- On some simple degree conditions that guarantee the upper bound on the chromatic (choice) number of random graphs
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- scientific article; zbMATH DE number 1523257 (Why is no real title available?)
- The strong chromatic index ofC4-free graphs
- Random lifts of graphs: Independence and chromatic number
- Concentration of non‐Lipschitz functions and applications
- On the Lovász Theta Function for Independent Sets in Sparse Graphs
- Randomly colouring graphs (a combinatorial view)
- A stronger bound for the strong chromatic index
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Extremal problems in hypergraph colourings
- A short proof of Brooks’ Theorem for vertex arboricity
- On the method of typical bounded differences
- Algorithmic bounds for the chromatic number†
- Colouring graphs with forbidden bipartite subgraphs
- A counterexample to the Bollobás–Riordan conjectures on sparse graph limits
- Sparse sets in the complements of graphs with given girth
- A sequential algorithm for generating random graphs
- Adaptable and conflict colouring multigraphs with no cycles of length three or four
- Efficiently list‐edge coloring multigraphs asymptotically optimally
- scientific article; zbMATH DE number 7758308 (Why is no real title available?)
- Graph and hypergraph colouring via nibble methods: a survey
- The list version of the Borodin-Kostochka conjecture for graphs with large maximum degree
- A proof of the Erdős-Faber-Lovász conjecture
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
- On triangle-free list assignments
- Strengthened Brooks' theorem for digraphs of girth at least three
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- Coloring locally sparse graphs
- Borel versions of the local lemma and local algorithms for graphs of finite asymptotic separation index
- Coloring simple hypergraphs
- An improved bound on the chromatic number of the pancake graphs
This page was built for publication: On Brooks' Theorem for Sparse Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852428)
