Intersecting longest paths

DOI10.1016/J.DISC.2013.02.016MaRDI QIDQ389499zbMATH OpenOpenAlexFDO

Authors Susanna F. de Rezende, Cristina G. Fernandes, Daniel Martin, 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

zbMATH Keywords

2-treeintersection of longest pathslongest pathouterplanar graph

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45)

Recommendations

• Intersection of longest paths in a graph
• A new approach towards a conjecture on intersecting three longest paths
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
• All longest cycles in a 2‐connected partial 3‐tree share a common vertex
• scientific article; zbMATH DE number 4174966

Cites work

• A Theorem on Planar Graphs
• A two-connected planar graph without concurrent longest paths
• scientific article; zbMATH DE number 2134119 (Why is no real title available?)
• scientific article; zbMATH DE number 4174966 (Why is no real title available?)
• scientific article; zbMATH DE number 5294801 (Why is no real title available?)
• scientific article; zbMATH DE number 49078 (Why is no real title available?)
• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• scientific article; zbMATH DE number 3248752 (Why is no real title available?)
• Intersection of longest paths in a graph
• Longest Paths in Circular Arc Graphs
• On longest paths and circuits in graphs.
• Planar and infinite hypohamiltonian and hypotraceable graphs
• Research problems
• Smallest sets of longest paths with empty intersection
• Steiner trees, partial 2–trees, and minimum IFI networks
• Ü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
• Über längste Wege und Kreise in Graphen
• Vertices missed by longest paths or circuits
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?

Cited in

(24)

• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Bounding the distance among longest paths in a connected graph
• Well-partitioned chordal graphs
• Intersecting longest paths in chordal graphs
• Three problems on well-partitioned chordal graphs
• On longest cycles in grid graphs
• Detour trees
• 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
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
• Order of the smallest counterexample to Gallai's conjecture
• Archimedean tiling graphs with Gallai's property
• The fair sharing graph and its Helly property
• Intersecting longest paths and longest cycles: a survey
• Intersection of longest paths in graph classes
• 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
• Long Alternating Paths Exist
• Bonds Intersecting Long Paths in \(k\) -Connected Graphs
• Intersecting longest cycles in Archimedean tilings
• 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

This page was built for publication: Intersecting longest paths

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