A left-first search algorithm for planar graphs
type: Item
instance of: scholarly article
title: A left-first search algorithm for planar graphs
zbMATH Open document ID: 0826.68090
DOI: 10.1007/BF02574056
author: Hubert de Fraysseix
author: P. Ossona de Mendez
author: János Pach
published in: Discrete \& Computational Geometry
publication date: 1995-07-02T00:00:00Z
full work available at URL: https://eudml.org/doc/131374
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 764238
MaRDI profile type: Publication
cites work: Bipartite graphs, upward drawings, and planarity
cites work: st-ordering the vertices of biconnected graphs
cites work: Intersection graphs of curves in the plane
cites work: Computing an st-numbering
cites work: Q4328183
cites work: Bipolar orientations revisited
cites work: How to draw a planar graph on a grid
cites work: Light sources, obstructions and spherical orders
cites work: On grid intersection graphs
cites work: Planar lattices and planar graphs
cites work: Two trees in maximal planar bipartite graphs
cites work: Q4918384
cites work: Q5203027
cites work: Rectilinear planar layouts and bipolar orientations of planar graphs
cites work: Q3795247
cites work: A unified approach to visibility representations of planar graphs
cites work: Q3785982
cites work: Q3719851
cites work: On the Classification of Graphs
OpenAlex ID: W1989142182
description: scientific article; zbMATH DE number 764238