Minimal obstructions to \(( \infty , k )\)-polarity in cographs
From MaRDI portal
Publication:2032730
DOI10.1016/j.disc.2021.112407zbMath1466.05140arXiv2104.07852MaRDI QIDQ2032730
César Hernández-Cruz, F. Esteban Contreras-Mendoza
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.07852
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C62: Graph representations (geometric and intersection representations, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polarity of chordal graphs
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Complement reducible graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Minimal obstructions to \(( s , 1 )\)-polarity in cographs
- Minimal obstructions to 2-polar cographs
- Complexity and algorithms for recognizing polar and monopolar graphs
- Corrigendum to ``Polar cographs
- Line-Polar Graphs: Characterization and Recognition
- Polar Permutation Graphs
- List Partitions
- On the Polarity and Monopolarity of Graphs
- Induced subgraphs and well‐quasi‐ordering
- Polar cographs