Polar permutation graphs are polynomial-time recognisable

DOI10.1016/j.ejc.2011.12.007zbMath1257.05127OpenAlexW2083238533MaRDI QIDQ1933641

Daniel Meister, Pinar Heggernes, Tınaz Ekim

Publication date: 24 January 2013

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2011.12.007

zbMATH Keywords

bipartite graphssplit graphsmatrix partitionscobipartite 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 (4)

Complexity and algorithms for recognizing polar and monopolar graphs ⋮ Generalized Coloring of Permutations ⋮ Algorithms for unipolar and generalized split graphs ⋮ Partitioning a graph into disjoint cliques and a triangle-free graph

This page was built for publication: Polar permutation graphs are polynomial-time recognisable