120 search results - page 5 / 24 » Cycle lengths in sparse graphs |
108
click to vote
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set...
108
click to vote
CIAC
2003
Springer
15 years 5 months ago
2003
Springer
Abstract. In this paper we show that every chordal graph with n vertices and m edges admits an additive 4-spanner with at most 2n−2 edges and an additive 3-spanner with at most O...
135
click to vote
COMGEO
2012
ACM
13 years 7 months ago
2012
ACM
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
DM
2007
14 years 11 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 ...
DM
2007
14 years 11 months ago
2007
An even-hole-free graph is a graph that does not contain, as an induced subgraph, a chordless cycle of even length. A graph is triangulated if it does not contain any chordless cy...