Constructing featured supereulerian graph
Mansour J. Algefari · Journal of Discrete Mathematical Sciences and Cryptography · 2022
A graph is supereulerian if it has a spanning eulerian subgraph. In this paper we construct a supereulerian graph controlling its matching number, minimum degree and edge connectivity, where δ(G) < α′(G)