A two-connected planar graph without concurrent longest paths

DOI10.1016/0095-8956(72)90048-2zbMath0243.05110MaRDI 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

05C35: Extremal problems in graph theory

05C10: Planar graphs; geometric and topological aspects of graph theory

Related Items

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

Cites Work

• Unnamed Item
• Ü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