Well-partitioned chordal graphs
From MaRDI portal
Publication:2144581
Recommendations
Cites work
- \(b\)-coloring of tight graphs
- A characterization of substar graphs
- A note on longest paths in circular arc graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Algorithmic graph theory and perfect graphs
- Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
- Certifying algorithms
- Clustering and domination in perfect graphs
- Computational Complexity of Geodetic Set
- Computing minimum geodetic sets of proper interval graphs
- Detecting holes and antiholes in graphs
- Detour trees
- Dominating sets for split and bipartite graphs
- Fundamentals of parameterized complexity
- Geodesic Convexity in Graphs
- Graph Classes: A Survey
- Graphs with small fall-spectrum
- HAMILTONian circuits in chordal bipartite graphs
- Hardness and approximation for the geodetic set problem in some graph classes
- scientific article; zbMATH DE number 6118220 (Why is no real title available?)
- scientific article; zbMATH DE number 4174966 (Why is no real title available?)
- scientific article; zbMATH DE number 1496855 (Why is no real title available?)
- scientific article; zbMATH DE number 3451870 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- scientific article; zbMATH DE number 7765365 (Why is no real title available?)
- Incidence matrices and interval graphs
- Intersecting longest paths
- Intersection of longest paths in graph classes
- Kernelization. Theory of parameterized preprocessing
- Longest Paths in Circular Arc Graphs
- Lower bounds on the mim-width of some graph classes
- Nonempty intersection of longest paths in \(2K_2\)-free graphs
- Nonempty intersection of longest paths in series-parallel graphs
- On longest paths and circuits in graphs.
- On sparse spanners of weighted graphs
- On the hardness of finding the geodetic number of a subcubic graph
- On the pathwidth of chordal graphs
- Optimal On-Line Simulations of Tree Machines by Random Access Machines
- Parameterized algorithms
- Parameterized Complexity of Geodetic Set
- Polynomial time algorithm for computing a minimum geodetic set in outerplanar graphs
- Restrictions of minimum spanner problems
- Some remarks on the geodetic number of a graph
- Subtree and substar intersection numbers
- The geodetic number of a graph
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Three problems on well-partitioned chordal graphs
- Transversals of Longest Paths and Cycles
- Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms
- Tree 3-spanners on interval, permutation and regular bipartite graphs
- Tree Spanners
- Tree spanners for bipartite graphs and probe interval graphs
- Tree spanners in planar graphs
- Tree spanners on chordal graphs: complexity and algorithms
- Well-partitioned chordal graphs: obstruction set and disjoint paths
Cited in
(20)- Partitioning chordal graphs into independent sets and cliques
- Partitioning chordal graphs
- scientific article; zbMATH DE number 617574 (Why is no real title available?)
- Bad News for Chordal Partitions
- LATIN 2004: Theoretical Informatics
- Algorithms and complexity for geodetic sets on partial grids
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs
- Problems in NP can admit double-exponential lower bounds when parameterized by treewidth or vertex cover
- Min-sum disjoint paths on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Kernels for the disjoint paths problem on subclasses of chordal graphs
- Multi-word-representability of graphs
- Enumerating minimal solution sets for metric graph problems
- Enumerating minimal solution sets for metric graph problems
- Min-sum disjoint paths on subclasses of chordal graphs
- Bounds and extremal graphs for monitoring edge-geodetic sets in graphs
- Algorithms and complexity for geodetic sets on interval and chordal graphs
- Bipartite domination in graphs: complexity and algorithms
- Algorithms and hardness for geodetic set on tree-like digraphs
- Geodetic set on graphs of constant pathwidth and feedback vertex set number
This page was built for publication: Well-partitioned chordal graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144581)
