Minimal obstructions to 2-polar cographs
From MaRDI portal
Publication:2414467
DOI10.1016/j.dam.2018.01.007zbMath1410.05164arXiv1703.03500MaRDI QIDQ2414467
César Hernández-Cruz, Cláudia Linhares Sales, Pavol Hell
Publication date: 17 May 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1703.03500
polar graph; cograph; forbidden subgraph characterization; matrix partition; generalized coloring; \(k\)-polar graph
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C15: Coloring of graphs and hypergraphs
Related Items
Cites Work
- About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
- Vertex-partitioning into fixed additive induced-hereditary properties is NP-hard
- Complexity and algorithms for recognizing polar and monopolar graphs
- Corrigendum to ``Polar cographs
- Graph partitions with prescribed patterns
- List Partitions
- Induced subgraphs and well‐quasi‐ordering
- Polar cographs
- Unnamed Item
- Unnamed Item
- Unnamed Item