Longest Paths in Circular Arc Graphs

DOI10.1017/S0963548304006145MaRDI QIDQ4819244zbMATH OpenWikidataFDO

Authors Jeno Lehel, R. H. Schelp, Paul Balister, Ervin Győri

Publication date 24 September 2004

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

zbMATH Keywords

Helly propertylongest cycleinterval graphlongest pathcircular arc graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cited in

(23)

• Spiders everywhere
• Bounding the distance among longest paths in a connected graph
• Detour trees
• Intersecting longest paths
• Computing and counting longest paths on circular-arc graphs in polynomial time
• Gallai's question and constructions of almost hypotraceable graphs
• All longest cycles in a 2‐connected partial 3‐tree share a common vertex
• Nonempty intersection of longest paths in series-parallel graphs
• Nonempty intersection of longest paths in \(2K_2\)-free graphs
• Well-partitioned chordal graphs
• Nonempty intersection of longest paths in a graph with a small matching number
• Longest paths through an arc in strong semicomplete multipartite digraphs
• Intersection of longest paths in a graph
• Paths in interval graphs and circular arc graphs
• Three problems on well-partitioned chordal graphs
• Intersecting longest paths in chordal graphs
• Bonds Intersecting Long Paths in \(k\) -Connected Graphs
• A note on longest paths in circular arc graphs
• Intersection of longest paths in graph classes
• Intersection of longest paths in graph classes
• Order of the smallest counterexample to Gallai's conjecture
• Non-empty intersection of longest paths in \(H\)-free graphs
• WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?

This page was built for publication: Longest Paths in Circular Arc Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4819244)