Sciweavers

4 search results - page 1 / 1
» On a conjecture of Keedwell and the cycle double cover conje...
Sort
View
DM
2000
130views more  DM 2000»
13 years 4 months ago
On a conjecture of Keedwell and the cycle double cover conjecture
At the 16th British Combinatorial Conference (1997), Cameron introduced a new concept called 2-simultaneous coloring. He used this concept to reformulate a conjecture of Keedwell ...
Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Sa...
EJC
2002
13 years 4 months ago
Cycle Cover Ratio of Regular Matroids
A cycle in a matroid is a disjoint union of circuits. This paper proves that every regular matroid M without coloops has a set S of cycles whose union is E(M) such that every elem...
Hong-Jian Lai, Hoifung Poon
JGT
2007
146views more  JGT 2007»
13 years 4 months ago
Compatible circuit decompositions of 4-regular graphs
A transition system T of an Eulerian graph G is a family of partitions of the edges incident to each vertex of G into transitions i.e. subsets of size two. A circuit decomposition...
Herbert Fleischner, François Genest, Bill J...
GC
2007
Springer
13 years 4 months ago
Local Topological Toughness and Local Factors
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
Frank Göring, Gyula Y. Katona