Eulerian-minors and a concise recursive characterization of 4-regular planar graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916089070354432 |
|---|---|
| author | Metsidik, Metrose Yan, Qi |
| author_facet | Metsidik, Metrose Yan, Qi |
| contents | An Eulerian-minor of an Eulerian graph is obtained from an Eulerian subgraph of the Eulerian graph by contraction. The Eulerian-minor operation preserves Eulerian properties of graphs and moreover Eulerian graphs are well-quasi-ordered under Eulerian-minor relation. In this paper, we characterize Eulerian, planar and outer-planar Eulerian graphs by means of excluded Eulerian-minors, and provide a concise recursive characterization to 4-regular planar graphs. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_06285 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Eulerian-minors and a concise recursive characterization of 4-regular planar graphs Metsidik, Metrose Yan, Qi Combinatorics An Eulerian-minor of an Eulerian graph is obtained from an Eulerian subgraph of the Eulerian graph by contraction. The Eulerian-minor operation preserves Eulerian properties of graphs and moreover Eulerian graphs are well-quasi-ordered under Eulerian-minor relation. In this paper, we characterize Eulerian, planar and outer-planar Eulerian graphs by means of excluded Eulerian-minors, and provide a concise recursive characterization to 4-regular planar graphs. |
| title | Eulerian-minors and a concise recursive characterization of 4-regular planar graphs |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2401.06285 |