Results 41 to 43 of about 43 (43)

Cycle Partitions in Dense Regular Digraphs and Oriented Graphs

Forum of Mathematics, Sigma
A conjecture of Jackson from 1981 states that every d-regular oriented graph on n vertices with $n\leq 4d+1$ is Hamiltonian. We prove this conjecture for sufficiently large n.
Allan Lo, Viresh Patel, Mehmet Akif Yıldız   +2 more
doaj   +1 more source

Eulerian character degree graphs of solvable groups

AKCE International Journal of Graphs and Combinatorics
Let G be a finite group, let Irr(G) be the set of all complex irreducible characters of G and let cd(G) be the set of all degrees of characters in [Formula: see text] Let [Formula: see text] be the set of all primes that divide some degrees in [Formula ...
G. Sivanesan, C. Selvaraj, T. Tamizh Chelvam   +2 more
doaj   +1 more source

Addendum to “Ring elements as sums of units”

Open Mathematics, 2013
Lanski Charles, Maróti Attila
doaj   +1 more source