Pages that link to "Item:Q5317568"
From MaRDI portal
The following pages link to Precoloring Extensions of Brooks' Theorem (Q5317568):
Displayed 14 items.
- The complexity of changing colourings with bounded maximum degree (Q407523) (← links)
- Every graph \(G\) is Hall \(\Delta(G)\)-extendible (Q727195) (← links)
- Distance constraints in graph color extensions (Q885289) (← links)
- Precoloring extension for 2-connected graphs with maximum degree three (Q1044924) (← links)
- Extending precolorings to distinguish group actions (Q1645056) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four (Q2243143) (← links)
- Extending precolorings to circular colorings (Q2496199) (← links)
- Hard coloring problems in low degree planar bipartite graphs (Q2506359) (← links)
- Precoloring extension involving pairs of vertices of small distance (Q2636808) (← links)
- Extensions of Fractional Precolorings Show Discontinuous Behavior (Q2930044) (← links)
- On Baire measurable colorings of group actions (Q5019557) (← links)
- (Q5109073) (← links)
- Brooks' theorem with forbidden colors (Q6144912) (← links)