Transversals of longest cycles in partial k‐trees and chordal graphs

DOI10.1002/jgt.22714zbMath1522.05492arXiv1912.12230OpenAlexW3183893547MaRDI QIDQ6056759

No author found.

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

treewidthtransversalchordal graphpartial \(k\)-treelongest cycle

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12) Transversal (matching) theory (05D15)

Related Items (1)

All longest cycles in a 2‐connected partial 3‐tree share a common vertex

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Detour trees
• Intersecting longest paths
• A partial k-arboretum of graphs with bounded treewidth
• Exact numbers of longest cycles with empty intersection
• Intersections of longest cycles in \(k\)-connected graphs
• Algorithmic graph theory and perfect graphs
• Transversals of longest cycles in chordal and bounded tree-width graphs
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Embeddings of graphs of fixed treewidth and bounded degree
• New upper bounds on the decomposability of planar graphs
• A Separator Theorem for Nonplanar Graphs
• Three results for trees, using mathematical induction
• On the Intersections of Longest Cycles in a Graph
• Transversals of Longest Paths and Cycles
• Intersecting longest paths and longest cycles: A survey
• Transversals of longest paths

This page was built for publication: Transversals of longest cycles in partial k‐trees and chordal graphs