Precoloring Extensions of Brooks' Theorem
From MaRDI portal
Recommendations
Cited in
(23)- Precoloring extension for 2-connected graphs with maximum degree three
- The colour theorems of Brooks and Gallai extended
- Local nature of Brooks' colouring for degree 3 graphs
- On the number of precolouring extensions
- Extending precolorings to distinguish group actions
- Extension from precoloured sets of edges
- A note on graph coloring extensions and list-colorings
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
- Extending precolorings to circular colorings
- Hard coloring problems in low degree planar bipartite graphs
- Precoloring extension involving pairs of vertices of small distance
- Extending fractional precolorings
- Extensions of fractional precolorings show discontinuous behavior
- Nondegenerate colourings in the Brooks theorem
- The complexity of changing colourings with bounded maximum degree
- Degree‐bounded coloring of graphs: Variations on a theme by brooks
- On Baire measurable colorings of group actions
- Hall spectra and extending precolorings with extra colors
- A precolouring extension of Vizing's theorem
- Brooks' theorem with forbidden colors
- Every graph G is Hall (G)-extendible
- Distance constraints in graph color extensions
This page was built for publication: Precoloring Extensions of Brooks' Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317568)
