Minimal obstructions to \(( s , 1 )\)-polarity in cographs
From MaRDI portal
Publication:2184672
DOI10.1016/j.dam.2018.11.028zbMath1440.05165arXiv2104.07856OpenAlexW2903764142MaRDI QIDQ2184672
César Hernández-Cruz, F. Esteban Contreras-Mendoza
Publication date: 29 May 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.07856
polar graphcographmonopolar graphforbidden subgraph characterizationmatrix partitiongeneralized colouring
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Complement reducible graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Corrigendum to ``Polar cographs
- Graph partitions with prescribed patterns
- List Partitions
- On the Polarity and Monopolarity of Graphs
- Induced subgraphs and well‐quasi‐ordering
- Polar cographs
- Polar cographs
This page was built for publication: Minimal obstructions to \(( s , 1 )\)-polarity in cographs