641 search results - page 50 / 129 » On Planar Quasi-Parity Graphs |
132
click to vote
CCCG
2007
15 years 7 months ago
2007
In this paper we study the problem of computing homothetic triangle contact representations of planar graphs. Since not all planar graphs admit such a representation, we concentra...
151
click to vote
ICIP
2002
IEEE
16 years 7 months ago
2002
IEEE
Recent interest in region based image coding has given rise to graph coloring based partition encoding methods. These methods are based on the four color theorem for planar graphs...
162
click to vote
FSTTCS
2009
Springer
16 years 20 days ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
181
click to vote
SWAT
2004
Springer
15 years 11 months ago
2004
Springer
We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
175
click to vote
WG
2001
Springer
15 years 10 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...