601 search results - page 73 / 121 » Edge-dominating cycles in graphs |
ITCC
2003
IEEE
14 years 1 months ago
2003
IEEE
In this paper we present a distance-hereditary decomposition of optimal chordal rings of 2k2 nodes into a set of rings of 2k nodes, where k is the diameter. All the rings belongin...
EJC
2007
13 years 8 months ago
2007
It was conjectured by Thomassen ([B. Alspach, C. Godsil, Cycle in graphs, Ann. Discrete Math. 27 (1985)], p. 466) that every longest circuit of a 3-connected graph must have a cho...
NIPS
1996
13 years 10 months ago
1996
It is shown that conventional computers can be exponentially faster than planar Hopfield networks: although there are planar Hopfield networks that take exponential time to conver...
IWOCA
2009
Springer
14 years 3 months ago
2009
Springer
The Feedback Vertex Set problem asks whether a graph contains q vertices meeting all its cycles. This is not a local property, in the sense that we cannot check if q vertices meet...
ALGORITHMICA
2006
13 years 8 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...