Enumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4-regular planar graphs can be computed effectively as the s...
Saved in:
| Published in: | Electronic notes in discrete mathematics Vol. 61; pp. 933 - 939 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article Publication |
| Language: | English |
| Published: |
Elsevier B.V
01.08.2017
|
| Subjects: | |
| ISSN: | 1571-0653, 1571-0653 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!