Bonds Intersecting Long Paths in \(k\) -Connected Graphs
From MaRDI portal
Publication:6098461
DOI10.1137/22m1481105zbMath1512.05236arXiv2201.11245OpenAlexW4379141656MaRDI QIDQ6098461
Haidong Wu, Bing Wei, Qinghong Zhao
Publication date: 14 June 2023
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.11245
Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Transversal (matching) theory (05D15) Connectivity (05C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detour trees
- Intersecting longest paths
- Nonempty intersection of longest paths in series-parallel graphs
- Planar and infinite hypohamiltonian and hypotraceable graphs
- Nonempty intersection of longest paths in \(2K_2\)-free graphs
- Gallai's question and constructions of almost hypotraceable graphs
- A note on longest paths in circular arc graphs
- Bonds intersecting cycles in a graph
- Intersecting longest paths in chordal graphs
- Nonempty intersection of longest paths in a graph with a small matching number
- An Upper Bound on the Number of Edges of a 2-Connected Graph
- On longest paths and circuits in graphs.
- Longest Paths in Circular Arc Graphs
- Transversals of Longest Paths and Cycles
- Intersecting longest paths and longest cycles: A survey
- Some Theorems on Abstract Graphs
- Intersection of longest paths in graph classes
This page was built for publication: Bonds Intersecting Long Paths in \(k\) -Connected Graphs
