Colouring Random Regular Graphs
From MaRDI portal
Recommendations
- Colouring random graphs
- scientific article; zbMATH DE number 4101221
- scientific article; zbMATH DE number 4134071
- Coloring random graphs
- Coloring random graphs
- Coloring random graphs
- Randomly coloring random graphs
- Randomly colouring graphs (a combinatorial view)
- Colouring Random 4-Regular Graphs
- Colouring random geometric graphs
Cited in
(19)- On the chromatic number of random \(d\)-regular graphs
- Random regular graphs of non-constant degree: concentration of the chromatic number
- On the number of regular configurations
- Neighbour-distinguishing edge colourings of random regular graphs
- Lower bounds on the chromatic number of random graphs
- Coloring random graphs
- Coloring random graphs
- Randomly coloring random graphs
- Properties of regular graphs with large girth via local algorithms
- On the chromatic number of a random 5-regular graph
- Irregular colorings of regular graphs
- Randomly colouring graphs (a combinatorial view)
- The acyclic edge chromatic number of a random d‐regular graph is d + 1
- scientific article; zbMATH DE number 861409 (Why is no real title available?)
- Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors
- Colouring Random 4-Regular Graphs
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Colorings of the \(d\)-regular infinite tree
- On the chromatic number of random regular graphs
This page was built for publication: Colouring Random Regular Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3438144)
