Polar cographs

DOI10.1016/j.dam.2007.08.025zbMath1152.05356OpenAlexW2914970624MaRDI QIDQ5900347

N. V. R. Mahadev, Dominique de Werra, Tınaz Ekim

Publication date: 10 September 2008

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2007.08.025

zbMATH Keywords

cographssplit graphsthreshold graphspolar graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Unnamed Item ⋮ Recognizing line-polar bipartite graphs in time \(O(n)\) ⋮ Minimal obstructions to 2-polar cographs ⋮ Minimal obstructions to \(( s , 1 )\)-polarity in cographs ⋮ List monopolar partitions of claw-free graphs ⋮ Complexity and algorithms for recognizing polar and monopolar graphs ⋮ On the Polarity and Monopolarity of Graphs ⋮ A forbidden subgraph characterization of line-polar bipartite graphs ⋮ Minimal obstructions to \(( \infty , k )\)-polarity in cographs ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving partition problems with colour-bipartitions ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph

Cites Work

• Unnamed Item
• About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
• Complement reducible graphs
• Threshold graphs and related topics
• Partitioning cographs into cliques and stable sets
• List Partitions

This page was built for publication: Polar cographs