Which directed graphs have a solution?
Mehdi Behzad, Frank Harary (1977)
Mathematica Slovaca
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “On the -basis of a digraph”
Which directed graphs have a solution?
Comparing a Cayley digraph with its reverse.
Abas, M. (2000)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On Hallian digraphs and their binding number
Mieczysław Borowiecki, Danuta Michalak (1989)
Banach Center Publications
Similarity:
A note on removing a point of a strong digraph
Peter Horák (1983)
Mathematica Slovaca
Similarity:
Problems on fully irregular digraphs
Zdzisław Skupień (1999)
Discussiones Mathematicae Graph Theory
Similarity:
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...
On Hallian digraphs, permanents and transversals
Miroslaw Arczyński, Mieczysław Borowiecki, Maciej M. Sysło (1979)
Colloquium Mathematicae
Similarity:
A remark on almost Moore digraphs of degree three.
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
On graphs all of whose {C₃,T₃}-free arc colorations are kernel-perfect
Hortensia Galeana-Sánchez, José de Jesús García-Ruvalcaba (2001)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph D is called a kernel-perfect digraph or KP-digraph when every induced subdigraph of D has a kernel. We call the digraph D an m-coloured digraph if the arcs of D are coloured with m distinct colours. A path P is monochromatic in D if all of its arcs are coloured alike in D. The closure of D, denoted by ζ(D), is the m-coloured digraph defined as follows: V( ζ(D)) = V(D), and A( ζ(D)) = ∪_{i} {(u,v) with colour i: there exists a monochromatic...