Intersecting longest paths
From MaRDI portal
Publication:389499
DOI10.1016/j.disc.2013.02.016zbMath1279.05041OpenAlexW2015208587MaRDI QIDQ389499
Cristina G. Fernandes, Daniel M. Martin, Susanna F. de Rezende, Yoshiko Wakabayashi
Publication date: 20 January 2014
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2013.02.016
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)
Related Items (14)
Detour trees ⋮ Well-partitioned chordal graphs ⋮ Order of the smallest counterexample to Gallai's conjecture ⋮ 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 ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Intersecting longest cycles in Archimedean tilings ⋮ Bounding the distance among longest paths in a connected graph ⋮ Three problems on well-partitioned chordal graphs ⋮ Intersection of longest paths in graph classes ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ Transversals of longest paths
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Über längste Wege und Kreise in Graphen
- A two-connected planar graph without concurrent longest paths
- Vertices missed by longest paths or circuits
- Smallest Sets of Longest Paths with Empty Intersection
- A Theorem on Planar Graphs
- Steiner trees, partial 2–trees, and minimum IFI networks
- WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
- On longest paths and circuits in graphs.
- Longest Paths in Circular Arc Graphs
- Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen
- Über die Nichtexistenz zweier Knotenpunkte eines Graphen, die alle längsten Kreise fassen
- Research problems
This page was built for publication: Intersecting longest paths