On longest paths and circuits in graphs.
From MaRDI portal
Publication:4103566
DOI10.7146/math.scand.a-11630zbMath0337.05127MaRDI QIDQ4103566
Publication date: 1976
Published in: MATHEMATICA SCANDINAVICA (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/166469
05C35: Extremal problems in graph theory
Related Items
Order of the smallest counterexample to Gallai's conjecture, Highly non-concurrent longest paths in lattices, Sublinear Longest Path Transversals, $K_2$-Hamiltonian Graphs: I, Transversals of longest paths, Unnamed Item, 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, Intersecting longest cycles in Archimedean tilings, On non-traceable, non-hypotraceable, arachnoid graphs, Planar lattice graphs with Gallai's property, Highly non-concurrent longest cycles in lattice graphs, Intersecting longest paths, On constructions of hypotraceable graphs, Nonempty intersection of longest paths in series-parallel graphs, Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs, Über längste Wege und Kreise in Graphen, Planar cubic hypohamiltonian and hypotraceable graphs, Ein planarer hypohamiltonscher Graph mit 57 Knoten, Bounding the distance among longest paths in a connected graph, Gallai's question and constructions of almost hypotraceable graphs, Well-partitioned chordal graphs, Improvements on Hippchen's conjecture, On minimum leaf spanning trees and a criticality notion, Nonempty intersection of longest paths in graphs without forbidden pairs, Destroying longest cycles in graphs and digraphs, Gallai's property for graphs in lattices on the torus and the Möbius strip, Even cycles and even 2-factors in the line graph of a simple graph, Unrooted non-binary tree-based phylogenetic networks, Intersecting longest paths in chordal graphs, Non-empty intersection of longest paths in \(H\)-free graphs, Three problems on well-partitioned chordal graphs, Unnamed Item, Smallest Sets of Longest Paths with Empty Intersection, Nonempty intersection of longest paths in a graph with a small matching number, Planar Hypohamiltonian Graphs on 40 Vertices, Leaf-Critical and Leaf-Stable Graphs, On planar hypohamiltonian graphs, A planar hypohamiltonian graph with 48 vertices, On r-regular r-connected non-hamiltonian graphs
