Transversals of longest paths

DOI10.1016/j.disc.2019.111717zbMath1431.05051arXiv1712.07086OpenAlexW2963142961WikidataQ122112499 ScholiaQ122112499MaRDI QIDQ5919333

No author found.

Publication date: 22 January 2020

Published in: Electronic Notes in Discrete Mathematics, Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1712.07086

zbMATH Keywords

treewidthpermutationtransversallongest pathchordalbipartite permutationfull substar graphplanar 3-treesubstars

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Distance in graphs (05C12) Transversal (matching) theory (05D15) Connectivity (05C40)

Related Items (9)

Well-partitioned chordal graphs ⋮ Transversals of longest cycles in partial k‐trees and chordal graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Path eccentricity of graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Unnamed Item ⋮ Reducing graph transversals via edge contractions ⋮ Transversals of longest paths ⋮ $K_2$-Hamiltonian Graphs: I

Cites Work

• Unnamed Item
• Unnamed Item
• Detour trees
• Intersecting longest paths
• Nonempty intersection of longest paths in series-parallel graphs
• Forbidden minors characterization of partial 3-trees
• Bipartite permutation graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• A note on longest paths in circular arc graphs
• Nonempty intersection of longest paths in a graph with a small matching number
• On longest paths and circuits in graphs.
• Longest Paths in Circular Arc Graphs
• Transversals of Longest Paths and Cycles
• Algorithms and Computation
• Intersection of longest paths in graph classes
• Transversals of longest paths

This page was built for publication: Transversals of longest paths