On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
From MaRDI portal
Publication:793048
Recommendations
- An Eberhard-like theorem for pentagons and heptagons
- Addendum to the article: Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
- scientific article; zbMATH DE number 3988272
- On face-vectors of 5-valent convex 3-polytopes
- Re-embedding structures of 5-connected projective-planar graphs
Cites work
- scientific article; zbMATH DE number 3877886 (Why is no real title available?)
- scientific article; zbMATH DE number 3814463 (Why is no real title available?)
- scientific article; zbMATH DE number 3489994 (Why is no real title available?)
- scientific article; zbMATH DE number 3507663 (Why is no real title available?)
- scientific article; zbMATH DE number 3586185 (Why is no real title available?)
- scientific article; zbMATH DE number 3454466 (Why is no real title available?)
- scientific article; zbMATH DE number 3217679 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- An existence theorem for simple convex polyhedra
- Convex 4-valent polytopes
- Extending two theorems of A. Kotzig
- Five-valent convex polyhedra with prescribed faces
- On Face-Vectors and Vertex-Vectors of Cell-Decompositions of Orientable 2-Manifolds
- Some analogues of Eberhard's theorem on convex polytopes
- Strengthening of a theorem about 3-polytopes
- Über 3-realisierbare Folgen mit beliebigen Sechseckzahlen
Cited in
(3)
This page was built for publication: On a problem of J. Zaks concerning 5-valent 3-connected planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q793048)