Graph color extensions: When Hadwiger's conjecture and embeddings help
zbMATH Open1005.05017MaRDI QIDQ698612FDOQ698612
Authors: Michael O. Albertson, Joan P. Hutchinson 
Publication date: 22 September 2002
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/122366
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- A structural theorem on embedded graphs and its application to colorings
- Extending graph colorings
- Extremal graphs in some coloring problems
- scientific article; zbMATH DE number 3487493
- On simultaneous colorings of embedded graphs
- Extending partial colorings of graphs
- Color refinement, homomorphisms, and hypergraphs
- Coloring sums of extensions of certain graphs
- scientific article; zbMATH DE number 2156263
- Edge colorings of embedded graphs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (12)
- On list-coloring outerplanar graphs
- Complexity issues in color-preserving graph embeddings
- Extending colorings of planar graphs
- Precoloring extension involving pairs of vertices of small distance
- Mc-Extensions: Examples, Zero-Divisors Graph, and Colorability
- Distance constraints in graph color extensions
- Extending precolorings of subgraphs of locally planar graphs
- Precoloring extension for 2-connected graphs with maximum degree three
- Extensions of fractional precolorings show discontinuous behavior
- A structural theorem on embedded graphs and its application to colorings
- Extending precolorings to circular colorings
- Hyperbolic families and coloring graphs on surfaces
This page was built for publication: Graph color extensions: When Hadwiger's conjecture and embeddings help
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698612)
