Intersection of chordal graphs and some related partition problems
From MaRDI portal
Publication:6657232
Recommendations
Cites work
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- A special planar satisfiability problem and a consequence of its NP- completeness
- Algorithmic Aspects of Vertex Elimination on Graphs
- Graph Classes: A Survey
- Induced matchings
- Intersection dimensions of graph classes
- New bounds for matrix multiplication: from alpha to omega
- New min-max theorems for weakly chordal and dually chordal graphs
- On dimensional properties of graphs
- On the 2-Chain Subgraph Cover and Related Problems
- On the chordality of a graph
- On the computational complexity of (O,P)-partition problems
- Partitions of graphs into one or two independent sets and cliques
- The Complexity of the Partial Order Dimension Problem
- The complexity of some problems related to GRAPH 3-COLORABILITY
This page was built for publication: Intersection of chordal graphs and some related partition problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657232)