ALGORITHMICA
2006
13 years 11 months ago
2006
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 subgraphs. We perform a detail...
DAM
2008
13 years 11 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
STOC
1991
ACM
14 years 2 months ago
1991
ACM
act We give an algorithm for imbedding a graph G of n vertices onto an oriented surface of minimal genus g. If g > 0 then we also construct a forbidden subgraph of G which is ho...