Dichromatic number, circulant tournaments and Zykov sums of digraphs

Víctor Neumann-Lara

The search session has expired. Please query the service again.

Displaying similar documents to “Dichromatic number, circulant tournaments and Zykov sums of digraphs”

k-Kernels and some operations in digraphs

Hortensia Galeana-Sanchez, Laura Pastrana (2009)

Discussiones Mathematicae Graph Theory

Similarity:

Let D be a digraph. V(D) denotes the set of vertices of D; a set N ⊆ V(D) is said to be a k-kernel of D if it satisfies the following two conditions: for every pair of different vertices u,v ∈ N it holds that every directed path between them has length at least k and for every vertex x ∈ V(D)-N there is a vertex y ∈ N such that there is an xy-directed path of length at most k-1. In this paper, we consider some operations on digraphs and prove the existence of k-kernels in digraphs formed...

A remark on almost Moore digraphs of degree three.

Baskoro, E.T., Miller, M., Širáň, J. (1997)

Acta Mathematica Universitatis Comenianae. New Series

Similarity:

Some remarks about digraphs with nonisomorphic $1$ - or $2$ -neighbourhoods

Halina Bielak, Elżbieta Soczewińska (1983)

Časopis pro pěstování matematiky

Similarity:

Monochromatic paths and monochromatic sets of arcs in 3-quasitransitive digraphs

Hortensia Galeana-Sánchez, R. Rojas-Monroy, B. Zavala (2009)

Discussiones Mathematicae Graph Theory

Similarity:

We call the digraph D an m-coloured digraph if the arcs of D are coloured with m colours. A directed path is called monochromatic if all of its arcs are coloured alike. A set N of vertices of D is called a kernel by monochromatic paths if for every pair of vertices of N there is no monochromatic path between them and for every vertex v ∉ N there is a monochromatic path from v to N. We denote by A⁺(u) the set of arcs of D that have u as the initial vertex. We prove that if D is an m-coloured...

Randomly Eulerian digraphs

Gary Chartrand, Don R. Lick (1971)

Czechoslovak Mathematical Journal

Similarity:

On (4, 2)-digraphs containing a cycle of length 2.

Iswadi, Hazrul, Baskoro, Edy Tri (2000)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

New proofs of the uniqueness of extremal noneven digraphs.

Lim, Chjan C., Van Patten, Gregory K. (2001)

Bulletin of the Malaysian Mathematical Sciences Society. Second Series

Similarity:

On the complete digraphs which are simply disconnected.

Davide C. Demaria, José Carlos de Souza Kiihl (1991)

Publicacions Matemàtiques

Similarity:

Homotopic methods are employed for the characterization of the complete digraphs which are the composition of non-trivial highly regular tournaments.