Sciweavers

147 search results - page 6 / 30
» Cycle decompositions of the complete graph
Sort
View
IWOCA
2009
Springer
160views Algorithms» more  IWOCA 2009»
14 years 15 days ago
Note on Decomposition of Kn, n into (0, j)-prisms
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
Sylwia Cichacz, Dalibor Froncek, Petr Kovár
DM
1998
68views more  DM 1998»
13 years 7 months ago
Alternating cycles and trails in 2-edge-coloured complete multigraphs
We consider edge-coloured multigraphs. A trail in such a multigraph is alternating if its successive edges differ in colour. Let G be a 2-edge-coloured complete graph and let M b...
Jørgen Bang-Jensen, Gregory Gutin
DM
1998
83views more  DM 1998»
13 years 7 months ago
The basis number of the powers of the complete graph
A basis of the cycle space C(G) of a graph G is h-fold if each edge of G occurs in at most h cycles of the basis. The basis number b(G) of G is the least integer h such that C(G) ...
Salar Y. Alsardary, Jerzy Wojciechowski
WG
2010
Springer
13 years 6 months ago
On the Small Cycle Transversal of Planar Graphs
We consider the problem of finding a k-edge transversal set that covers all (simple) cycles of length at most s in a planar graph, where s ≥ 3 is a constant. This problem, refe...
Ge Xia, Yong Zhang