Graph color extensions: When Hadwiger's conjecture and embeddings help
From MaRDI portal
(Redirected from Publication:698612)
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
Cited in
(12)- On list-coloring outerplanar graphs
- Extending precolorings of subgraphs of locally planar graphs
- Extending precolorings to circular colorings
- Precoloring extension for 2-connected graphs with maximum degree three
- Mc-Extensions: Examples, Zero-Divisors Graph, and Colorability
- Precoloring extension involving pairs of vertices of small distance
- Complexity issues in color-preserving graph embeddings
- Distance constraints in graph color extensions
- Extensions of fractional precolorings show discontinuous behavior
- A structural theorem on embedded graphs and its application to colorings
- Hyperbolic families and coloring graphs on surfaces
- Extending colorings of planar graphs
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)
