Minimal obstructions to \(( \infty , k )\)-polarity in cographs

DOI10.1016/j.disc.2021.112407zbMath1466.05140arXiv2104.07852OpenAlexW3156627844MaRDI 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

zbMATH Keywords

polar graphcographforbidden subgraph characterizationmatrix partitiongeneralized coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph representations (geometric and intersection representations, etc.) (05C62)

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

This page was built for publication: Minimal obstructions to \(( \infty , k )\)-polarity in cographs