OpenAlex
PricingAboutJobs
Log inGet started
Work

An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation

HTML

Year: 2003
Type: conference-paper
Source: Lecture notes in computer science
Parent work: STACS 2003: 20th Annual Symposium on Theoretical Aspects of Computer Science Berlin, Germany, February 27 – March 1, 2003 Proceedings
DOI: 10.1007/3-540-36494-3_44
Authors: Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse
Institutions: Laboratoire Bordelais de Recherche en Informatique, Université Bordeaux-I
Language: English

Topic: Advanced Combinatorial Mathematics
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: planar graphs, graph enumeration, graph triangulation, maximal planar graphs, edge count bounds

Open Access status: closed
OpenAlex ID: W1504530241
FWCI: 7.7
Cites: 35
Cited by: 47
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Supporters
Legal
Privacy
Accessibility
Terms