Results 141 to 150 of about 763 (151)

Sufficient Conditions for a Digraph to be Supereulerian

Journal of Graph Theory, 2015
Jørgen Bang-Jensen, Alessandro Maddaloni   +1 more
exaly  

Semikernels, Quasi Kernels, and Grundy Functions in the Line Digraph

SIAM Journal on Discrete Mathematics, 1991
H Galeana-Sánchez
exaly  

On the out-domination and in-domination numbers of a digraph

Discrete Mathematics, 1999
Gary Chartrand
exaly  

Line Digraph Iterations and the (d, k) Digraph Problem

IEEE Transactions on Computers, 1984
exaly  

Finding a Longest Path in a Complete Multipartite Digraph

SIAM Journal on Discrete Mathematics, 1993
G Gutin
exaly  

On the difference of the domination number of a digraph and of its reverse

Discrete Applied Mathematics, 2012
Stefan Gyürki
exaly  

A new sufficient condition for a digraph to be Hamiltonian

Discrete Applied Mathematics, 1999
Anders Yeo
exaly  

Superpure digraph designs

Journal of Combinatorial Designs, 2002
exaly  

Spectra of digraph transformations

Linear Algebra and Its Applications, 2013
exaly  

Cayley Digraphs of Groups

openaire   +1 more source