Nonempty intersection of longest paths in a graph with a small matching number

DOI10.1007/s10587-015-0193-2zbMath1363.05129OpenAlexW1829898164MaRDI QIDQ2948007

Fu-Yuan Chen

Publication date: 29 September 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/144287

zbMATH Keywords

matching numberlongest path

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (9)

Order of the smallest counterexample to Gallai's conjecture ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Hyperideal-based intersection graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Intersection of longest paths in graph classes ⋮ Nonempty intersection of longest paths in graphs without forbidden pairs ⋮ Intersection of longest paths in graph classes ⋮ Transversals of longest paths

Cites Work

• Unnamed Item
• Unnamed Item
• Intersecting longest paths
• Nonempty intersection of longest paths in series-parallel graphs
• On longest paths and circuits in graphs.
• Longest Paths in Circular Arc Graphs
• Intersecting longest paths and longest cycles: A survey
• Über die Nichtexistenz eines Knotenpunktes, durch den alle längsten Wege eines Graphen gehen

This page was built for publication: Nonempty intersection of longest paths in a graph with a small matching number