On longest paths and circuits in graphs.

DOI10.7146/math.scand.a-11630zbMath0337.05127OpenAlexW2531095544MaRDI QIDQ4103566

Tudor I. Zamfirescu

Publication date: 1976

Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items (41)

Well-partitioned chordal graphs ⋮ On non-traceable, non-hypotraceable, arachnoid graphs ⋮ Improvements on Hippchen's conjecture ⋮ Gallai's property for graphs in lattices on the torus and the Möbius strip ⋮ Unrooted non-binary tree-based phylogenetic networks ⋮ Order of the smallest counterexample to Gallai's conjecture ⋮ Planar lattice graphs with Gallai's property ⋮ Highly non-concurrent longest cycles in lattice graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ On minimum leaf spanning trees and a criticality notion ⋮ Intersecting longest paths ⋮ Nonempty intersection of longest paths in a graph with a small matching number ⋮ Sums of distances on graphs and embeddings into Euclidean space ⋮ Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Planar Hypohamiltonian Graphs on 40 Vertices ⋮ Intersecting longest paths in chordal graphs ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Bounding the distance among longest paths in a connected graph ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Unnamed Item ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ Highly non-concurrent longest paths in lattices ⋮ On planar hypohamiltonian graphs ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ On constructions of hypotraceable graphs ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Unnamed Item ⋮ Über längste Wege und Kreise in Graphen ⋮ A planar hypohamiltonian graph with 48 vertices ⋮ Smallest Sets of Longest Paths with Empty Intersection ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ Planar cubic hypohamiltonian and hypotraceable graphs ⋮ Ein planarer hypohamiltonscher Graph mit 57 Knoten ⋮ Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs ⋮ Transversals of longest paths ⋮ On r-regular r-connected non-hamiltonian graphs ⋮ Sublinear Longest Path Transversals ⋮ $K_2$-Hamiltonian Graphs: I ⋮ Destroying longest cycles in graphs and digraphs

This page was built for publication: On longest paths and circuits in graphs.