Longest Paths in Circular Arc Graphs
From MaRDI portal
Publication:4819244
DOI10.1017/S0963548304006145zbMath1051.05053WikidataQ114653948 ScholiaQ114653948MaRDI QIDQ4819244
Jenő Lehel, Richard H. Schelp, Paul N. Balister, Ervin Gyoeri
Publication date: 24 September 2004
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Related Items (21)
Detour trees ⋮ Well-partitioned chordal graphs ⋮ Nonempty intersection of longest paths in \(2K_2\)-free graphs ⋮ Order of the smallest counterexample to Gallai's conjecture ⋮ Intersecting longest paths ⋮ Nonempty intersection of longest paths in a graph with a small matching number ⋮ All longest cycles in a 2‐connected partial 3‐tree share a common vertex ⋮ Bonds Intersecting Long Paths in \(k\) -Connected Graphs ⋮ Intersecting longest paths in chordal graphs ⋮ Bounding the distance among longest paths in a connected graph ⋮ Non-empty intersection of longest paths in \(H\)-free graphs ⋮ Three problems on well-partitioned chordal graphs ⋮ Spiders everywhere ⋮ Intersection of longest paths in graph classes ⋮ Intersection of longest paths in graph classes ⋮ Gallai's question and constructions of almost hypotraceable graphs ⋮ Unnamed Item ⋮ Nonempty intersection of longest paths in series-parallel graphs ⋮ A note on longest paths in circular arc graphs ⋮ Transversals of longest paths ⋮ WHEN DO THREE LONGEST PATHS HAVE A COMMON VERTEX?
This page was built for publication: Longest Paths in Circular Arc Graphs
