Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
From MaRDI portal
Publication:5576237
DOI10.1016/S0021-9800(69)80098-0zbMath0184.27504OpenAlexW2016117822MaRDI QIDQ5576237
Publication date: 1969
Published in: Journal of Combinatorial Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0021-9800(69)80098-0
Related Items (30)
Detour trees ⋮ Nonempty intersection of longest paths in \(2K_2\)-free graphs ⋮ On non-traceable, non-hypotraceable, arachnoid graphs ⋮ Polytopes, graphs, and complexes ⋮ Order of the smallest counterexample to Gallai's conjecture ⋮ Planar lattice graphs with Gallai's property ⋮ Intersecting longest paths ⋮ Nonempty intersection of longest paths in a graph with a small matching number ⋮ All longest cycles in a 2‐connected partial 3‐tree share a common vertex ⋮ Improved upper bounds on longest-path and maximal-subdivision transversals ⋮ 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 ⋮ Leaf-Critical and Leaf-Stable Graphs ⋮ Spiders everywhere ⋮ Lattice graphs with non-concurrent longest cycles ⋮ Highly non-concurrent longest paths in lattices ⋮ On planar hypohamiltonian graphs ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Intersection of longest paths in graph classes ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Unnamed Item ⋮ Über längste Wege und Kreise in Graphen ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ A two-connected planar graph without concurrent longest paths ⋮ Vertices missed by longest paths or circuits ⋮ Hamiltonian paths in Cayley graphs ⋮ Sublinear Longest Path Transversals ⋮ $K_2$-Hamiltonian Graphs: I
This page was built for publication: Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
