Minimal obstructions to \(( s , 1 )\)-polarity in cographs
From MaRDI portal
Publication:2184672
DOI10.1016/j.dam.2018.11.028zbMath1440.05165arXiv2104.07856MaRDI 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 graph; cograph; monopolar graph; forbidden subgraph characterization; matrix partition; generalized colouring
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
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