Polar permutation graphs are polynomial-time recognisable
type: Item
instance of: scholarly article
title: Polar permutation graphs are polynomial-time recognisable
zbMATH Open document ID: 1257.05127
author: Tınaz Ekim
author: Pinar Heggernes
author: Daniel Meister
published in: European Journal of Combinatorics
publication date: 2013-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6128658
zbMATH Keywords: bipartite graphs
zbMATH Keywords: cobipartite graphs
zbMATH Keywords: split graphs
zbMATH Keywords: matrix partitions
MaRDI profile type: Publication
full work available at URL: j.ejc.2011.12.007
OpenAlex ID: W2083238533
DOI: 10.1016/J.EJC.2011.12.007
description: scientific article; zbMATH DE number 6128658