scientific article; zbMATH DE number 4152401

zbMATH Open0703.05022MaRDI QIDQ3481722FDOQ3481722

Authors: R. Balakrishnan, P. Paulraja 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
• 4-connected projective planar graphs are Hamiltonian
• scientific article; zbMATH DE number 475584
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• Counterexamples to Grötzsch-Sachs-Koester's conjecture

zbMATH Keywords

Hamiltonian cycle4-connected 4-regular planar graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cited In (9)

• Solution to Farhadi–Ghahramani’s multiplier problem
• Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs
• Problem 17 of Grätzer and Kisielewicz
• The Solution to a Problem of Grünbaum
• A solution to a problem of Jacobson, Kézdy and Lehel
• Solution to a Problem of Goranko and Passy
• On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
• Title not available (Why is that?)
• A solution to a problem of Marek and Truszcyński

This page was built for publication:

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