686 search results - page 10 / 138 » Packing Cycles in Graphs |
ENDM
2010
14 years 9 months ago
2010
Finding a feasible solution for a bi-dimensional Orthogonal Packing Problem (OPP2) consists in deciding whether a set of rectangular boxes (items) can be packed in a "big&quo...
CCCG
2009
14 years 10 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
DM
2007
14 years 9 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
COMBINATORICS
2007
14 years 9 months ago
2007
A graph is self-complementary if it is isomorphic to its complement. In this paper we prove that every forest of order 4p and size less than 3p is a subgraph of a self-complementa...
JGAA
2007
14 years 9 months ago
2007
We show how to find a Hamiltonian cycle in a graph of degree at most three with n vertices, in time O(2n/3