vix.ing · top · new · best · stats · spec

Eulerian-minors and a concise recursive characterization of 4-regular planar graphs

2024/01/11 by Metrose Metsidik, Qi Yan, Metsidik, Metrose +1
Computer Science · Mathematics · #Advanced Graph Theory Research #Graph theory and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.2401.06285

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.

Related