686 search results - page 11 / 138 » Packing Cycles in Graphs |
DM
2010
14 years 9 months ago
2010
We prove that every planar graph in which no i-cycle is adjacent to a j-cycle whenever 3 i j 7 is 3-colorable and pose some related problems on the 3-colorability of planar grap...
EJC
2006
14 years 9 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
114
click to vote
ICFP
2012
ACM
12 years 12 months ago
2012
ACM
This paper presents a new functional programming model for graph structures called structured graphs. Structured graphs extend conventional algebraic datatypes with explicit defi...
ESA
2004
Springer
15 years 2 months ago
2004
Springer
Abstract. We obtain faster algorithms for problems such as rdimensional matching, r-set packing, graph packing, and graph edge packing when the size k of the solution is considered...
JGT
2006
14 years 9 months ago
2006
We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly