Intersection of chordal graphs and some related partition problems
From MaRDI portal
Publication:6657232
DOI10.1016/J.DAM.2024.10.010MaRDI QIDQ6657232FDOQ6657232
Authors: Atif A. Abueida, Arthur H. Busch, R. Sritharan
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Graph Classes: A Survey
- A linear-time algorithm for testing the truth of certain quantified Boolean formulas
- Induced matchings
- The Complexity of the Partial Order Dimension Problem
- Algorithmic Aspects of Vertex Elimination on Graphs
- On the 2-Chain Subgraph Cover and Related Problems
- A special planar satisfiability problem and a consequence of its NP- completeness
- Partitions of graphs into one or two independent sets and cliques
- The complexity of some problems related to GRAPH 3-COLORABILITY
- On dimensional properties of graphs
- Intersection dimensions of graph classes
- New min-max theorems for weakly chordal and dually chordal graphs
- On the computational complexity of (O,P)-partition problems
- On the chordality of a graph
- New bounds for matrix multiplication: from alpha to omega
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)