13 search results - page 3 / 3 » Induced Packing of Odd Cycles in a Planar Graph |
99
Voted
ALGORITHMICA
2006
14 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...
108
click to vote
JCT
2008
14 years 11 months ago
2008
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002, Chudnovsky, Robertson, Seym...
ICALP
2009
Springer
15 years 12 months ago
2009
Springer
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, whi...