Precoloring extension forK4-minor-free graphs
From MaRDI portal
Publication:3633010
Recommendations
- On r-hued coloring of K₄-minor free graphs
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Minimal \(k\)-extensions of precomplete graphs
- Coloring the square of a \(K_{4}\)-minor free graph
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- An algorithm on strong edge coloring of \(K_4\)-minor free graphs
- Coloring perfect \((K_ 4\)-e)-free graphs
- Equitable colorings of \(K_4\)-minor-free graphs
- Precoloring extension on chordal graphs
- Precoloring Extension for 2‐connected Graphs
Cites work
- scientific article; zbMATH DE number 854567 (Why is no real title available?)
- A note on graph coloring extensions and list-colorings
- Distance constraints in graph color extensions
- Extending colorings of locally planar graphs
- Extending graph colorings
- Extending graph colorings using no extra colors
- Extending precolorings of subgraphs of locally planar graphs
- Precoloring Extension for 2‐connected Graphs
- Precoloring extension for 2-connected graphs with maximum degree three
- You can't paint yourself into a corner
Cited in
(8)- Extending precolorings to distinguish group actions
- On list-coloring outerplanar graphs
- A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- List-coloring graphs without \(K_{4,k}\)-minors
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Distance constraints in graph color extensions
- List colorings of \(K_5\)-minor-free graphs with special list assignments
This page was built for publication: Precoloring extension forK4-minor-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3633010)
