Oct 7, 2005 · The 3-coloring problem is NP-hard if the forbidden subgraph is a path with at least one edge, and it is polynomially solvable in all other cases ...
If the forbidden subgraph is a tree T with at least two edges, then both weakly and strongly T-free 2-colorings are NP-hard for planar graphs. Hence, these ...
We consider the problem of coloring a planar graph with the minimum number of colors such that each color class avoids one or more forbidden graphs as ...
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as ...
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as ...
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult,Algorithmica,Fedor V. Fomin, Jan Kratochvil, Gerhard J. Woeginger, ...
Planar Graph Coloring Avoiding Monochromatic Subgraphs: Trees and Paths Make It Difficult · Mathematics. Algorithmica · 2005.
People also ask
What is the problem of graph coloring?
What is the 5 color theorem of graph theory?
Does a planar graph have to be simple?
Can a planar graph be a tree?
Oct 30, 2022 · We study the complexity of deciding for fixed and whether a given simple digraph admits an -free -coloring.
Aug 15, 2018 · The vertices of planar graph can be partitioned in two trees if and only if its planar dual is hamiltonian.
Sep 10, 2024 · The complexity of Colouring is fully understood for H-free graphs, but there are still major complexity gaps if two induced subgraphs H1 and H2 ...