Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree
Sign Up to like & getrecommendations! Published in 2021 at "Graphs and Combinatorics"
DOI: 10.1007/s00373-020-02229-x
Abstract: A graph is supereulerian if it has a spanning eulerian subgraph. We show that a connected simple graph G with $$n = |V(G)| \ge 2$$ n = | V ( G ) | ≥ 2… read more here.
Keywords: graphs; graphs constraints; constraints matching; graph ... See more keywords