Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A new approach to the linearity of testing planarity of graphs

From MaRDI portal
Publication:1117237
Jump to:navigation, search

DOI10.1007/BF02006222zbMath0667.05020MaRDI QIDQ1117237

Yanpei Liu

Publication date: 1988

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)


zbMATH Keywords

spanning treeplanarity testingtesting planarity


Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)


Related Items

A linear algorithm for 2-bend embeddings of planar graphs in the two-dimensional grid, Orthogonal drawings of graphs for the automation of VLSI circuit design, On Boolean characterizations of planarity and planar embeddings of graphs



Cites Work

  • Unnamed Item
  • On the linearity of testing planarity of graphs
  • Preuve Algebrique Du Critere De Planarite De Wu-Liu
  • Efficient Planarity Testing
  • Toward a theory of crossing numbers
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1117237&oldid=13162315"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:43.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki