Sciweavers

147 search results - page 3 / 30
» Cycle decompositions of the complete graph
Sort
View
ARSCOM
2004
104views more  ARSCOM 2004»
14 years 11 months ago
Complete Minors in Cubic Graphs with few short Cycles and Random Cubic Graphs
We first prove that for any fixed k a cubic graph with few short cycles contains a Kk-minor. This is a direct generalisation of a result on girth by Thomassen. We then use this the...
Klas Markstrom
JACM
2007
115views more  JACM 2007»
14 years 11 months ago
Optimal pants decompositions and shortest homotopic cycles on an orientable surface
We consider the problem of finding a shortest cycle (freely) homotopic to a given simple cycle on a compact, orientable surface. For this purpose, we use a pants decomposition of...
Éric Colin de Verdière, Francis Laza...
JCO
2007
74views more  JCO 2007»
14 years 11 months ago
Maximum cyclic 4-cycle packings of the complete multipartite graph
A graph G is said to be m-sufficient if m is not exceeding the order of G, each vertex of G is of even degree, and the number of edges in G is a multiple of m. A complete multipar...
Shung-Liang Wu, Hung-Lin Fu
LMCS
2006
119views more  LMCS 2006»
14 years 11 months ago
The monadic second-order logic of graphs XVI : Canonical graph decompositions
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...
Bruno Courcelle
COMBINATORICS
2006
128views more  COMBINATORICS 2006»
14 years 11 months ago
On Lengths of Rainbow Cycles
We prove several results regarding edge-colored complete graphs and rainbow cycles, cycles with no color appearing on more than one edge. We settle a question posed by Ball, Pultr...
Boris Alexeev