Sign in
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree
Journal article   Peer reviewed

Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree

Mansour J. Algefari and Hong-Jian Lai
Graphs and combinatorics, Vol.37(1), pp.55-64
01/01/2021

Abstract

Mathematics Physical Sciences Science & Technology
A graph is supereulerian if it has a spanning eulerian subgraph. We show that a connected simple graph G with n=vertical bar V(G)vertical bar >= 2 and delta(G)>=alpha '(G) is supereulerian if and only if G not equal K-1,K-n-1 if n is even or G not equal K-2,K-n-2 if n is odd. Consequently, every connected simple graph G with delta(G) >= alpha '(G) has a hamiltonian line graph.

Metrics

1 Record Views

Details