scholarly journals Uncountable dichromatic number without short directed cycles

2019 ◽  
Vol 94 (1) ◽  
pp. 113-116 ◽  
Author(s):  
Attila Joó
Keyword(s):  
Directed Cycles ◽  
Dichromatic Number

Disjoint directed cycles with specified lengths in directed bipartite graphs

2021 ◽  
Vol 344 (4) ◽  
pp. 112276
Author(s):  
Yunshu Gao ◽  
Hong Wang ◽  
Qingsong Zou
Keyword(s):  
Bipartite Graphs ◽  
Directed Cycles

scholarly journals An improved bound for disjoint directed cycles

2018 ◽  
Vol 341 (8) ◽  
pp. 2231-2236 ◽  
Author(s):  
Matija Bucić
Keyword(s):  
Directed Cycles

Conditions for the Separability of Objects in Two-Dimensional Velocity Fields

1992 ◽  
Vol 35 (4) ◽  
pp. 484-491
Author(s):  
Stephan Foldes
Keyword(s):  
Velocity Field ◽  
Directed Graph ◽  
Velocity Fields ◽  
Sufficient Condition ◽  
Two Dimensional ◽  
Jordan Curves ◽  
Directed Cycles

AbstractWe consider the directed graph representing the obstruction relation between objects moving along the streamlines of a two-dimensional velocity field. A collection of objects is sequentially separable if and only if the corresponding graph has no directed cycles. A sufficient condition for this is the permeability of closed Jordan curves.

Cooperative Salvo Guidance Using Finite-Time Consensus Over Directed Cycles

2020 ◽  
Vol 56 (2) ◽  
pp. 1504-1514 ◽  
Author(s):  
Shashi Ranjan Kumar ◽  
Dwaipayan Mukherjee
Keyword(s):  
Finite Time ◽  
Directed Cycles

scholarly journals Algebraic Algorithms for Even Circuits in Graphs

Mathematics ◽  
2019 ◽  
Vol 7 (9) ◽  
pp. 859
Author(s):  
Huy Tài Hà ◽  
Susan Morey
Keyword(s):  
Algebraic Algorithms ◽  
Directed Cycles

We present an algebraic algorithm to detect the existence of and to list all indecomposable even circuits in a given graph. We also discuss an application of our work to the study of directed cycles in digraphs.

scholarly journals Balanced directed cycle designs based on cyclic groups

1995 ◽  
Vol 58 (2) ◽  
pp. 210-218 ◽  
Author(s):  
Chaufah Nilrat ◽  
Cheryl E. Praeger
Keyword(s):  
Directed Graph ◽  
Cyclic Group ◽  
Complete Classification ◽  
Directed Cycle ◽  
Group Of Automorphisms ◽  
Edge Disjoint ◽  
Cyclic Groups ◽  
Directed Cycles

AbstractA balanced directed cycle design with parameters (υ, k, 1), sometimes called a (υ, k, 1)-design, is a decomposition of the complete directed graph into edge disjoint directed cycles of length k. A complete classification is given of (υ, k, 1)-designs admitting the holomorph {øa, b: x ↦ ax + b∣ a, b ∈ Zυ, (a, υ1) = 1} of the cyclic group Zυ as a group of automorphisms. In particular it is shown that such a design exists if and ony if one of (a) k = 2, (b) p ≡ 1 (mod k) for each prime p dividing υ, or (c) k is the least prime dividing υ, k2 does not divide υ, and p ≡ 1 (mod k) for each prime p < k dividing υ.

Sign in / Sign up

Export Citation Format

Share Document