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