Three problems on well-partitioned chordal graphs
From MaRDI portal
Publication:2692718
DOI10.1007/978-3-030-75242-2_2OpenAlexW3158114875MaRDI QIDQ2692718
Paloma T. Lima, Lars Jaffke, O-joung Kwon, Jungho Ahn
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_2
Related Items (2)
Well-partitioned chordal graphs ⋮ \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Detour trees
- Intersecting longest paths
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Nonempty intersection of longest paths in series-parallel graphs
- Hardness and approximation for the geodetic set problem in some graph classes
- Tree spanners for bipartite graphs and probe interval graphs
- Some remarks on the geodetic number of a graph
- On sparse spanners of weighted graphs
- The geodetic number of a graph
- Restrictions of minimum spanner problems
- Nonempty intersection of longest paths in \(2K_2\)-free graphs
- On the hardness of finding the geodetic number of a subcubic graph
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Well-partitioned chordal graphs: obstruction set and disjoint paths
- A note on longest paths in circular arc graphs
- Geodesic Convexity in Graphs
- Computing Minimum Geodetic Sets of Proper Interval Graphs
- Optimal On-Line Simulations of Tree Machines by Random Access Machines
- On longest paths and circuits in graphs.
- Computational Complexity of Geodetic Set
- Longest Paths in Circular Arc Graphs
- Tree Spanners
- Transversals of Longest Paths and Cycles
- Intersection of longest paths in graph classes
- Tree spanners in planar graphs
This page was built for publication: Three problems on well-partitioned chordal graphs
