About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
From MaRDI portal
Publication:1084418
DOI10.1016/0012-365X(86)90113-5zbMath0606.05058OpenAlexW192680164MaRDI QIDQ1084418
A. A. Chernyak, Zhanna A. Chernyak
Publication date: 1986
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(86)90113-5
Related Items (19)
Satgraphs and independent domination. I ⋮ Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 ⋮ Polar graphs and maximal independent sets ⋮ Recognizing line-polar bipartite graphs in time \(O(n)\) ⋮ Minimal obstructions to 2-polar cographs ⋮ Minimal obstructions to \(( s , 1 )\)-polarity in cographs ⋮ Unnamed Item ⋮ List monopolar partitions of claw-free graphs ⋮ Complexity and algorithms for recognizing polar and monopolar graphs ⋮ Polar cographs ⋮ Polar cographs ⋮ Polarity of chordal 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 ⋮ Graph partitions with prescribed patterns ⋮ Algorithms for unipolar and generalized split graphs ⋮ Solving partition problems with colour-bipartitions ⋮ Solving Partition Problems Almost Always Requires Pushing Many Vertices Around
Cites Work
This page was built for publication: About recognizing (\(\alpha\) ,\(\beta\) ) classes of polar graphs
