A digraph D is supereulerian if D contains a spanning eulerian subdigraph, or equivalently, a connected cycle factor. Thus, supereulerian digraphs must be strong, and every hamiltonian digraph is also a supereulerian digraph.
Sep 6, 2014 · A digraph D is supereulerian if D has a spanning eulerian subdigraph H . The main result of this paper determines a best possible lower bound of ...
People also ask
What are the 7 digraphs?
What are the 10 digraphs?
What are Euler's digraphs?
What are the 8 digraphs?
Apr 30, 2021 · A digraph D is supereulerian if D contains a spanning eulerian subdigraph, or equivalently, a connected cycle fac- tor. Thus, supereulerian ...
May 1, 2020 · In this paper, we give a sufficient and necessary conditions involving 3-path-quasi-transitive digraphs to be supereulerian and prove that the conjecture is ...
Eulerian digraphs. Supereulerian digraphs. Symmetrically connected digraphs. Partially symmetric digraphs ... digraph D is supereulerian if every arc a of D ...
Supereulerian digraphs. Mansour Algefari, West Virginia University. Let D be a digraph and let λ(D) be the arc-strong connectivity of D, and α/(D) be the size ...
Feb 6, 2018 · A digraph D is supereulerian if D has a spanning closed ditrail. Bang-Jensen and Thomassé conjectured that if the arc-strong connectivity ...
A digraph D is supereulerian if D has a spanning eulerian subdi- graph. We investigate forbidden induced subdigraph conditions for a strong digraph to be ...
Dec 17, 2021 · The property of being supereulerian can be considered as a relaxation of being hamiltonian: being supereulerian digraph means having a closed ...
On a Class of Supereulerian Digraphs - Applied Mathematics - SCIRP
www.scirp.org › journal › paperabs
A digraph D is supereulerian if D contains a spanning eulerian subdigraph. It has been noted that the 2-sum of two supereulerian (or even hamiltonian) digraphs ...