Pairs of Hamiltonian circuits in 5-connected planar graphs
type: Item
instance of: scholarly article
title: Pairs of Hamiltonian circuits in 5-connected planar graphs
zbMATH Open document ID: 0309.05120
DOI: 10.1016/0095-8956(76)90051-4
author: Joseph Zaks
published in: Journal of Combinatorial Theory. Series B
publication date: 1976-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C10
zbMATH DE Number: 3484105
MaRDI profile type: Publication
full work available at URL: 0095-8956(76)90051-4
OpenAlex ID: W2030734685
cites work: Q3941433
cites work: Q5575344
cites work: Simple paths on convex polyhedra
cites work: Hamiltonian circuits on simple 3-polytopes
cites work: Hamiltonian Circuits on Simple 3-Polytopes
cites work: Q5577694
cites work: Q5547252
cites work: Polytopes, graphs, and complexes
cites work: Pairs of edge-disjoint Hamiltonian circuits
cites work: The existence of certain planar maps
cites work: Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
cites work: Q5622209
cites work: Q5625217
cites work: Q5628163
cites work: Q5528475
cites work: Q5599567
cites work: On Hamiltonian Circuits
cites work: A Theorem on Planar Graphs
cites work: Über das Problem der Existenz von HAMILTONkreisen in planaren, regulären Graphen
cites work: On the 1-factors of n-connected graphs
description: scientific article; zbMATH DE number 3484105