Open Problem Garden
Help
About
Contact
login/create account
Home
»
Author index
Voss, Heinz-Jürgen
Graph Theory
»
Basic G.T.
»
Cycles
Every prism over a 3-connected planar graph is hamiltonian.
★★
Author(s):
Kaiser
;
Král
;
Rosenfeld
;
Ryjácek
;
Voss
Conjecture
If
is a
-connected planar graph, then
has a Hamilton cycle.
Keywords:
Posted by
fhavet
updated March 11th, 2013
add new comment
Navigate
Subject
Algebra
(295)
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
Nowhere-zero flows
Shuffle-Exchange Conjecture
Algebra
Seagull problem
Solution to the Lonely Runner Conjecture
more