Abstract
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)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have