Recommendations
Cites work
- Acyclic coloring of graphs
- Almost all 5-regular graphs have a 3-flow
- Cores of random graphs are born Hamiltonian
- Critical random graphs: Diameter and mixing time
- Graph Theory and Probability
- Hamiltonian circuits in random graphs
- Hamiltonicity thresholds in Achlioptas processes
- scientific article; zbMATH DE number 1540669 (Why is no real title available?)
- scientific article; zbMATH DE number 1380601 (Why is no real title available?)
- scientific article; zbMATH DE number 1414315 (Why is no real title available?)
- Improved bounds for the excluded-minor approximation of treedepth
- Introduction to Random Graphs
- Linear coloring of graphs
- Meyniel's conjecture holds for random \(d\)-regular graphs
- Meyniel's conjecture holds for random graphs
- On low tree-depth decompositions
- On the order of countable graphs
- On the tree-depth of random graphs
- Orderings on graphs and game coloring number
- Polynomial treedepth bounds in linear colorings
- Random graphs.
- Sparsity. Graphs, structures, and algorithms
- The longest path in a random graph
- The probabilistic method
- Tree-depth, subgraph coloring and homomorphism bounds
This page was built for publication: Linear colouring of binomial random graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646401)
