Open Problem Garden
Help
About
Contact
login/create account
Home
»
Keyword index
Eulerian
Graph Theory
»
Basic G.T.
»
Cycles
Decomposing eulerian graphs
★★★
Author(s):
Conjecture
If
is a 6-
edge-connected
Eulerian graph
and
is a 2-transition system for
, then
has a compaible decomposition.
Keywords:
cover
;
cycle
;
Eulerian
Posted by
mdevos
updated March 7th, 2007
add new comment
Navigate
Subject
Algebra
(7)
Analysis
(5)
Combinatorics
(35)
Geometry
(29)
Graph Theory
(228)
Group Theory
(5)
Logic
(10)
Number Theory
(49)
PDEs
(0)
Probability
(1)
Theoretical Comp. Sci.
(13)
Topology
(40)
Unsorted
(1)
Author index
Keyword index
more
Recent Activity
Chords of longest cycles
Do any three longest paths in a connected graph have a vertex in common?
Chromatic number of $\frac{3}{3}$-power of graph
3-Edge-Coloring Conjecture
r-regular graphs are not uniquely hamiltonian.
more