Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Graph Drawing

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

DOI10.1007/B94919zbMATH Open1215.05091OpenAlexW4250021921MaRDI QIDQ5193166FDOQ5193166


Authors: János Pach, Géza Tóth Edit this on Wikidata


Publication date: 11 August 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b94919




Recommendations

  • How many ways can one draw a graph?
  • scientific article; zbMATH DE number 3898914
  • scientific article; zbMATH DE number 434700
  • scientific article; zbMATH DE number 4198021
  • scientific article


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Graph representations (geometric and intersection representations, etc.) (05C62)



Cited In (7)

  • How many ways can one draw a graph?
  • Title not available (Why is that?)
  • Enumeration of simple complete topological graphs
  • Enumeration of simple complete topological graphs
  • How unproportional must a graph be?
  • The Complexity of Several Realizability Problems for Abstract Topological Graphs
  • Title not available (Why is that?)





This page was built for publication: Graph Drawing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5193166)

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5193166&oldid=19776067"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 16:33. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki