Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

DOI10.1016/S0021-9800(69)80098-0zbMATH Open0184.27504OpenAlexW2016117822MaRDI QIDQ5576237FDOQ5576237

Authors: Hansjoachim Walther 

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

zbMATH Keywords

topology

Cited In (30)

• Spiders everywhere
• Bounding the distance among longest paths in a connected graph
• Detour trees
• Intersecting longest paths
• Gallai's question and constructions of almost hypotraceable graphs
• All longest cycles in a 2‐connected partial 3‐tree share a common vertex
• Polytopes, graphs, and complexes
• A two-connected planar graph without concurrent longest paths
• Vertices missed by longest paths or circuits
• Nonempty intersection of longest paths in graphs without forbidden pairs
• Nonempty intersection of longest paths in series-parallel graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• \(K_2\)-Hamiltonian graphs: I
• Nonempty intersection of longest paths in a graph with a small matching number
• Intersecting longest cycles in Archimedean tilings
• Über längste Wege und Kreise in Graphen
• On non-traceable, non-hypotraceable, arachnoid graphs
• Intersection of longest paths in a graph
• On planar hypohamiltonian graphs
• Sublinear longest path transversals
• Intersecting longest paths in chordal graphs
• Hamiltonian paths in Cayley graphs
• Lattice graphs with non-concurrent longest cycles
• Leaf-critical and leaf-stable graphs
• Improved upper bounds on longest-path and maximal-subdivision transversals
• Highly non-concurrent longest paths in lattices
• Intersection of longest paths in graph classes
• Order of the smallest counterexample to Gallai's conjecture
• Planar lattice graphs with Gallai's property
• Non-empty intersection of longest paths in \(H\)-free graphs

This page was built for publication: Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5576237)