Results 91 to 100 of about 197 (101)

Scores, inequalities and regular hypertournaments

, 2012
Muhammad li Khan, S. Pirzada, K. K. Kayibi   +2 more
semanticscholar   +1 more source

On kernels by monochromatic paths in the corona of digraphs

Open Mathematics, 2008
Włoch Iwona
doaj   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Maximum Size of C≤ k-Free Strong Digraphs with Out-Degree at Least Two

Social Science Research Network, 2022
: Let H be a family of digraphs. A digraph D is H -free if it contains no isomorphic copy of any member of H . For k ≥ 2, we set C ≤ k = { C 2 , C 3 , . . . , C k } , where C (cid:96) is a directed cycle of length (cid:96) ∈ { 2 , 3 , . . . , k } . Let D
Bin Chen, Xinmin Hou
semanticscholar   +1 more source

Topologies on the edges set of directed graphs

, 2018
Khalid Abdulkalek Abdu, Adem Kılıçman
semanticscholar   +1 more source

On Suborbital Graphs for the Modular Group

, 2001
M. Akbaş
semanticscholar   +1 more source

Kernels by monochromatic paths and the color-class digraph

Discussiones Mathematicae Graph Theory, 2011
H. Galeana-Sánchez
semanticscholar   +1 more source

3-transitive Digraphs

Discussiones Mathematicae Graph Theory, 2012
César Hernández-Cruz
semanticscholar   +1 more source

Optimization of persistent land coverage by swarm of drones

, 2018
Z. R. Bogdanowicz
semanticscholar   +1 more source

(1, 2)‐Symplectic Metrics, Flag Manifolds and Tournaments

, 2002
N. Cohen, Caio J. C. Negreiros, L. S. San Martin   +2 more
semanticscholar   +1 more source