Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Jorgensen, Leif K.
Graph Theory
»
Basic G.T.
»
Minors
Jorgensen's Conjecture
★★★
Author(s):
Jorgensen
Conjecture
Every 6-
connected
graph without a
minor
is apex (planar plus one vertex).
Keywords:
connectivity
;
minor
Posted by
mdevos
updated March 10th, 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