Back to Search
Start Over
Adjacency posets of outerplanar graphs
- Publication Year :
- 2020
-
Abstract
- Felsner, Li and Trotter showed that the dimension of the adjacency poset of an outerplanar graph is at most 5, and gave an example of an outerplanar graph whose adjacency poset has dimension 4. We improve their upper bound to 4, which is then best possible.
- Subjects :
- Discrete mathematics
Mathematics::Combinatorics
Dimension (graph theory)
020206 networking & telecommunications
0102 computer and information sciences
02 engineering and technology
Computer Science::Computational Geometry
01 natural sciences
Upper and lower bounds
Theoretical Computer Science
Combinatorics
010201 computation theory & mathematics
Computer Science::Discrete Mathematics
Outerplanar graph
FOS: Mathematics
0202 electrical engineering, electronic engineering, information engineering
Discrete Mathematics and Combinatorics
Adjacency list
Mathematics - Combinatorics
Combinatorics (math.CO)
Partially ordered set
Computer Science::Data Structures and Algorithms
Mathematics
Subjects
Details
- Language :
- English
- Database :
- OpenAIRE
- Accession number :
- edsair.doi.dedup.....90255fc5ee8d06e9ac66870cf89e48fa