Eulerian-minors and a concise recursive characterization of 4-regular planar graphs
Combinatorics
2024-01-15 v1
Abstract
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.
Keywords
Cite
@article{arxiv.2401.06285,
title = {Eulerian-minors and a concise recursive characterization of 4-regular planar graphs},
author = {Metrose Metsidik and Qi Yan},
journal= {arXiv preprint arXiv:2401.06285},
year = {2024}
}
Comments
12 pages,7 figures