On minimal regular digraphs with girth 4
Qiao Li, Richard A. Brualdi (1983)
Czechoslovak Mathematical Journal
Similarity:
Qiao Li, Richard A. Brualdi (1983)
Czechoslovak Mathematical Journal
Similarity:
Mehdi Behzad, Gary Chartrand, Curtiss Wall (1970)
Fundamenta Mathematicae
Similarity:
Susan van Aardt, Marietjie Frick, Joy Singleton (2013)
Discussiones Mathematicae Graph Theory
Similarity:
In 1982 Laborde, Payan and Xuong [Independent sets and longest directed paths in digraphs, in: Graphs and other combinatorial topics (Prague, 1982) 173-177 (Teubner-Texte Math., 59 1983)] conjectured that every digraph has an independent detour transversal (IDT), i.e. an independent set which intersects every longest path. Havet [Stable set meeting every longest path, Discrete Math. 289 (2004) 169-173] showed that the conjecture holds for digraphs with independence number two. A digraph...
Gary Chartrand, Don R. Lick (1971)
Czechoslovak Mathematical Journal
Similarity:
Iswadi, Hazrul, Baskoro, Edy Tri (2000)
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
Similarity:
Hamburger, Peter, Haxell, Penny, Kostochka, Alexandr (2007)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
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...
Baskoro, E.T., Miller, M., Širáň, J. (1997)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Hortensia Galeana-Sánchez, Laura Pastrana Ramírez, Hugo Alberto Rincón Mejía (2005)
Discussiones Mathematicae Graph Theory
Similarity:
We call the digraph D an m-coloured digraph if its arcs are coloured with m colours. A directed path (or a directed cycle) is called monochromatic if all of its arcs are coloured alike. Let D be an m-coloured digraph. A set N ⊆ V(D) is said to be a kernel by monochromatic paths if it satisfies the following two conditions: (i) for every pair of different vertices u,v ∈ N there is no monochromatic directed path between them and (ii) for each vertex x ∈...