13
Views
0
CrossRef citations to date
0
Altmetric
Research Article

Constructing featured supereulerian graph

Pages 2729-2738 | Received 01 May 2021, Published online: 20 Dec 2022
 

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)

Subject Classification:

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.