Precoloring extension forK4-minor-free graphs
From MaRDI portal
Publication:3633010
DOI10.1002/JGT.20358zbMATH Open1229.05155OpenAlexW1578293636MaRDI QIDQ3633010FDOQ3633010
Authors: Anja Pruchnewski, Margit Voigt 
Publication date: 16 June 2009
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20358
Recommendations
- On \(r\)-hued coloring of \(K_4\)-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
Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Graph minors (05C83)
Cites Work
- Title not available (Why is that?)
- You can't paint yourself into a corner
- A note on graph coloring extensions and list-colorings
- Extending graph colorings
- Extending precolorings of subgraphs of locally planar graphs
- Extending colorings of locally planar graphs
- Distance constraints in graph color extensions
- Extending graph colorings using no extra colors
- Precoloring extension for 2-connected graphs with maximum degree three
- Precoloring Extension for 2‐connected Graphs
Cited In (8)
- Flexibility of planar graphs -- sharpening the tools to get lists of size four
- Extending precolorings to distinguish group actions
- On list-coloring outerplanar graphs
- Distance constraints in graph color extensions
- List colorings of \(K_5\)-minor-free graphs with special list assignments
- A note on \(K^-_{\Delta +1}\)-free precolouring with \(\Delta\) colours
- List-coloring graphs without \(K_{4,k}\)-minors
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
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)
