On longest paths and circuits in graphs.
From MaRDI portal
Cited in
(43)- Ü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
- Smallest sets of longest paths with empty intersection
- Intersection of longest paths in a graph
- 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
- On non-traceable, non-hypotraceable, arachnoid graphs
- A planar hypohamiltonian graph with 48 vertices
- Planar lattice graphs with Gallai's property
- Highly non-concurrent longest cycles in lattice graphs
- Intersecting longest paths
- On r-regular r-connected non-hamiltonian graphs
- Order of the smallest counterexample to Gallai's conjecture
- Highly non-concurrent longest paths in lattices
- Sublinear longest path transversals
- K₂-Hamiltonian graphs: I
- On constructions of hypotraceable graphs
- Sums of distances on graphs and embeddings into Euclidean space
- scientific article; zbMATH DE number 7746259 (Why is no real title available?)
- Improved upper bounds on longest-path and maximal-subdivision transversals
- Bonds Intersecting Long Paths in \(k\) -Connected Graphs
- Intersecting longest cycles in Archimedean tilings
- Longest path transversals in claw-free and P₅-free graphs
- Longest cycles in vertex-transitive and highly connected graphs
- Small hitting sets for longest paths and cycles
- Nonempty intersection of longest paths in series-parallel graphs
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
This page was built for publication: On longest paths and circuits in graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4103566)
