A planarity criterion for cubic bipartite graphs
type: Item
instance of: scholarly article
title: A planarity criterion for cubic bipartite graphs
zbMATH Open document ID: 0957.05028
DOI: 10.1016/S0012-365X(98)00090-9
author: Jochen Harant
author: T. Böhme
author: Anja Pruchnewski
author: Ingo Schiermeyer
published in: Discrete Mathematics
publication date: 2000-11-02T00:00:00Z
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 1524995
zbMATH Keywords: planarity
zbMATH Keywords: cubic bipartite graphs
zbMATH Keywords: bipartition
zbMATH Keywords: polynomial-time algorithm
MaRDI profile type: Publication
cites work: Q3856672
cites work: A strengthening of the Kuratowski planarity criterion for 3-connected graphs
cites work: Q5528475
cites work: A refinement of Kuratowski's theorem
full work available at URL: s0012-365x(98)00090-9
OpenAlex ID: W2081155888
description: scientific article; zbMATH DE number 1524995