Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Preissmann, Myriam
Graph Theory
»
Basic G.T.
»
Cycles
(m,n)-cycle covers
★★★
Author(s):
Celmins
;
Preissmann
Conjecture
Every
bridgeless
graph has a (5,2)-cycle-cover.
Keywords:
cover
;
cycle
Posted by
mdevos
updated March 7th, 2007
add new comment
Navigate
Subject
Algebra
(298)
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
Is Dragon Ball Legends Safe? Account Security Guide — Avoid Bans, Scams & Hacks (2026)
Dragon Ball Legends PvP Team Building Guide — Tags, Synergy & Win Conditions (2026)
Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
Dragon Ball Legends Free Chrono Crystals — Legit Methods That Actually Work (2026)
Nowhere-zero flows
more