A two-connected planar graph without concurrent longest paths

DOI10.1016/0095-8956(72)90048-2zbMath0243.05110OpenAlexW2021292985MaRDI QIDQ2554342

Tudor I. Zamfirescu

Publication date: 1972

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(72)90048-2

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (17)

Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Planar lattice graphs with Gallai's property ⋮ Highly non-concurrent longest cycles in lattice graphs ⋮ Intersecting longest paths ⋮ Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ Highly non-concurrent longest paths in lattices ⋮ On planar hypohamiltonian graphs ⋮ Über längste Wege und Kreise in Graphen ⋮ A planar hypohamiltonian graph with 48 vertices ⋮ Ein planarer hypohamiltonscher Graph mit 57 Knoten ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs ⋮ Vertices missed by longest paths or circuits ⋮ Sublinear Longest Path Transversals

Cites Work

• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
• Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen
• On Hamiltonian Circuits
• Unnamed Item

This page was built for publication: A two-connected planar graph without concurrent longest paths