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

DOI10.1007/BF01836203MaRDI QIDQ1226501zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A non-Hamiltonian planar graph
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3271352 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3102314 (Why is no real title available?)
• Regular n-valent n-connected non-Hamiltonian non n-edge-colourable graphs

Cited in

(8)

• 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
• On spanning subgraphs of 4-connected planar graphs
• Two Hamiltonian cycles
• Notes on upper bounds for the largest eigenvalue based on edge-decompositions of a signed graph
• Partitioning the triangles of the cross polytope into surfaces
• Hamiltonian cycles in subdivided doubles

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1226501)