Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Hajós, G.
Graph Theory
»
Basic G.T.
»
Cycles
Decomposing an eulerian graph into cycles.
★★
Author(s):
Hajós
Conjecture
Every simple eulerian graph on
vertices can be decomposed into at most
cycles.
Keywords:
Posted by
fhavet
updated March 4th, 2013
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