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