Polar Permutation Graphs

DOI10.1007/978-3-642-10217-2_23zbMath1267.05215OpenAlexW1578023046MaRDI QIDQ3651548

Tınaz Ekim, Daniel Meister, Pinar Heggernes

Publication date: 11 December 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10217-2_23

zbMATH Keywords

polynomial time algorithmbipartite graphssplit graphscomplete multipartite graphpermutation graphsmatrix partitionspolar graphscobipartite graphsdisjoint union of complete graphs

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Monopolar graphs: complexity of computing classical graph parameters ⋮ Recognizing line-polar bipartite graphs in time \(O(n)\) ⋮ List monopolar partitions of claw-free graphs ⋮ A forbidden subgraph characterization of line-polar bipartite graphs ⋮ Minimal obstructions to \(( \infty , k )\)-polarity in cographs ⋮ Solving partition problems with colour-bipartitions

This page was built for publication: Polar Permutation Graphs