6740 search results - page 62 / 1348 » An s -Hamiltonian Line Graph Problem |
ARSCOM
2005
13 years 7 months ago
2005
We investigate the supereulerian graph problems within planar graphs, and we prove that if a 2-edge-connected planar graph G is at most three edges short of having two edge-disjoi...
ARSCOM
2007
13 years 7 months ago
2007
A graph U is (induced)-universal for a class of graphs X if every member of X is contained in U as an induced subgraph. We study the problem of finding a universal graph with min...
DAM
2010
13 years 7 months ago
2010
In this paper, we study homomorphisms of 2-edge-colored graphs, that is graphs with edges colored with two colors. We consider various graph classes (outerplanar graphs, partial 2...
VAMOS
2007
Springer
14 years 1 months ago
2007
Springer
Requirements for product families are expressed in terms of commonality and variability. This distinction allows early identification of an appropriate software architecture and ...
AIPS
2007
13 years 10 months ago
2007
We present three new complexity results for classes of planning problems with simple causal graphs. First, we describe a polynomial time algorithm that uses macros to generate pla...