Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes

DOI10.1007/BF01836203zbMath0328.05118OpenAlexW2029820717MaRDI QIDQ1226501

Pierre Martin

Publication date: 1976

Published in: Aequationes Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/136561

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (6)

Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs ⋮ On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks ⋮ Edge-disjoint Hamilton cycles in 4-regular planar graphs ⋮ Partitioning the triangles of the cross polytope into surfaces ⋮ On spanning subgraphs of 4-connected planar graphs ⋮ Two Hamiltonian cycles

Cites Work

• Regular \(n\)-valent \(n\)-connected non-Hamiltonian non \(n\)-edge-colourable graphs
• A non-Hamiltonian planar graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Cycles Hamiltoniens dans les graphes 4-réguliers 4-connexes