1 February 2024 in Discrete Mathematics
14 August 2023 in Journal of Combinatorial Optimization
21 August 2025 in Graphs and Combinatorics
14 July 2026 in SSRN Electronic Journal
A graph is said to be supereulerian if it has a spanning eulerian subgraph. In this paper, we show that every 3-edge-connected graph with domination number at most 3 is supereulerian if and only if it is not contractible to the Petersen graph. Examples show that the condition of 3-edge-connectedness is sharp. As an application of the result, we show that the line graph L(G) of every 3-edge-connected graph G with domination number at most three is hamiltonian.
2 August 2023 in Graphs and Combinatorics