The following pages link to Colouring Random Regular Graphs (Q3438144):
Displaying 18 items.
- Coloring random graphs (Q293318) (← links)
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- Irregular colorings of regular graphs (Q442324) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colorings of the \(d\)-regular infinite tree (Q598463) (← links)
- On the chromatic number of random regular graphs (Q896008) (← links)
- On the chromatic number of random \(d\)-regular graphs (Q1043497) (← links)
- Random regular graphs of non-constant degree: concentration of the chromatic number (Q1043588) (← links)
- On the number of regular configurations (Q1106248) (← links)
- Neighbour-distinguishing edge colourings of random regular graphs (Q2500996) (← links)
- Lower bounds on the chromatic number of random graphs (Q2678448) (← links)
- Coloring random graphs (Q2837678) (← links)
- Randomly coloring random graphs (Q3055885) (← links)
- On the chromatic number of a random 5-regular graph (Q3652529) (← links)
- The acyclic edge chromatic number of a random <i>d</i>‐regular graph is <i>d</i> + 1 (Q4680406) (← links)
- Randomly Coloring Regular Bipartite Graphs and Graphs with Bounded Common Neighbors (Q4909519) (← links)
- Colouring Random 4-Regular Graphs (Q5295417) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313025) (← links)
