A note on longest paths in circular arc graphs

DOI10.7151/dmgt.1800zbMath1317.05102arXiv1312.3075OpenAlexW2963220582MaRDI QIDQ2516667

Felix Joos

Publication date: 4 August 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

circular arc graphslongest paths intersection

Mathematics Subject Classification ID

Paths and cycles (05C38)

Related Items (10)

Detour trees ⋮ Well-partitioned chordal graphs ⋮ Nonempty intersection of longest paths in \(2K_2\)-free graphs ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Intersection of longest paths in graph classes ⋮ Intersection of longest paths in graph classes ⋮ Transversals of longest paths

Cites Work

• Finding Hamiltonian circuits in interval graphs
• Longest Paths in Circular Arc Graphs
• Transversals of Longest Paths and Cycles
• Intersecting longest paths and longest cycles: A survey

This page was built for publication: A note on longest paths in circular arc graphs