LAUSR.org creates dashboard-style pages of related content for over 1.5 million academic articles. Sign Up to like articles & get recommendations!

Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree

Photo from archive.org

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 (… Click to show full 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 and $$\delta (G) \ge \alpha '(G)$$ δ ( G ) ≥ α ′ ( G ) is supereulerian if and only if $$G \ne K_{1,n-1}$$ G ≠ K 1 , n - 1 if n is even or $$G \ne K_{2, n-2}$$ G ≠ K 2 , n - 2 if n is odd. Consequently, every connected simple graph G with $$\delta (G) \ge \alpha '(G)$$ δ ( G ) ≥ α ′ ( G ) has a hamiltonian line graph.

Keywords: graphs; graphs constraints; constraints matching; graph; matching number; supereulerian graphs

Journal Title: Graphs and Combinatorics
Year Published: 2021

Link to full text (if available)


Share on Social Media:                               Sign Up to like & get
recommendations!

Related content

More Information              News              Social Media              Video              Recommended



                Click one of the above tabs to view related content.