Colouring graphs when the number of colours is almost the maximum degree
From MaRDI portal
Publication:462929
Recommendations
Cites work
- scientific article; zbMATH DE number 3882454 (Why is no real title available?)
- scientific article; zbMATH DE number 1189240 (Why is no real title available?)
- scientific article; zbMATH DE number 3492718 (Why is no real title available?)
- scientific article; zbMATH DE number 1286500 (Why is no real title available?)
- scientific article; zbMATH DE number 3043302 (Why is no real title available?)
- (\(\Delta-k\))-critical graphs
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations
- A constructive proof of the Lovász local lemma
- A constructive proof of the general Lovász local lemma
- An algorithmic approach to the Lovász local lemma. I
- Colouring graphs when the number of colours is nearly the maximum degree
- Concentration for Independent Permutations
- Concentration of measure and isoperimetric inequalities in product spaces
- Graph Theory and Probability
- Graph colouring and the probabilistic method
- On an upper bound of the graph's chromatic number, depending on the graph's degree and density
- Paths, Trees, and Flowers
- Probability Inequalities for Sums of Bounded Random Variables
- Uniquely Colourable Graphs and the Hardness of Colouring Graphs of Large Girth
- Weighted sums of certain dependent random variables
- Which problems have strongly exponential complexity?
Cited in
(30)- On graph folding and mobile radio frequency assignment
- Colouring graphs when the number of colours is nearly the maximum degree
- Graphs with chromatic numbers strictly less than their colouring numbers
- Colorings, transversals, and local sparsity
- The complexity of star colouring in bounded degree graphs and regular graphs
- On the inclusion chromatic index of a graph
- A note on \(\Delta\)-critical graphs
- A local epsilon version of Reed's conjecture
- Distant sum distinguishing index of graphs with bounded minimum degree
- Distributed algorithms, the Lovász local lemma, and descriptive combinatorics
- Hardness transitions and uniqueness of acyclic colouring
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
- New algorithm for calculating chromatic index of graphs and its applications
- The complexity of colouring problems on dense graphs
- scientific article; zbMATH DE number 7559119 (Why is no real title available?)
- (\(\Delta-k\))-critical graphs
- When removing an independent set is optimal for reducing the chromatic number
- Graphs with chromatic number close to maximum degree
- Open problems on graph coloring for special graph classes
- scientific article; zbMATH DE number 1189240 (Why is no real title available?)
- Conflict‐free chromatic number versus conflict‐free chromatic index
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring
- Asymptotically good edge correspondence colourings
- 19-linear-colorable graphs with maximum degree 6
- Distant set distinguishing edge colourings of graphs
- Ramsey-nice families of graphs
- Adaptable and conflict colouring multigraphs with no cycles of length three or four
- Deciding Relaxed Two-Colorability—A Hardness Jump
- Colouring H-free graphs of bounded diameter.
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter
This page was built for publication: Colouring graphs when the number of colours is almost the maximum degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462929)
