Guide to graph colouring. Algorithms and applications
From MaRDI portal
Recommendations
Cited in
(12)- Computing the chromatic number using graph decompositions via matrix rank
- Graph colouring algorithms
- A guide to graph colouring. Algorithms and applications
- Chromatic graph theory
- Optimal secret share distribution in degree splitting communication networks
- A fresh look at a randomized massively parallel graph coloring algorithm
- Software for proper vertex-colouring exploiting graph symmetry
- Graph coloring methods
- Quantum Mycielski graphs
- On z-coloring and \(\mathrm{b}^\ast \)-coloring of graphs as improved variants of the b-coloring
- Soft happy colourings and community structure of networks
- Optimality of DSatur algorithm on chordal graphs
This page was built for publication: Guide to graph colouring. Algorithms and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5007093)