19 search results - page 1 / 4 » Disjoint Color-Avoiding Triangles |
SIAMDM
2008
13 years 4 months ago
2008
A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be th...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
The problem of packing k edge-disjoint triangles in a graph has been thoroughly studied both in the classical complexity and the approximation fields and it has a wide range of ap...
WG
2004
Springer
13 years 10 months ago
2004
Springer
We consider the NP-complete problem of deciding whether an input graph on n vertices has k vertex-disjoint copies of a fixed graph H. For H = K3
JCT
2006
13 years 5 months ago
2006
We consider the class A of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between th...
DCG
2010
13 years 5 months ago
2010
An Apollonian configuration of circles is a collection of circles in the plane with disjoint interiors such that the complement of the interiors of the circles consists of curvili...