Nonderogatory unicyclic digraphs.
Bravo, Diego, Rada, Juan (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Bravo, Diego, Rada, Juan (2007)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Günter Schaar (1989)
Archivum Mathematicum
Similarity:
G. Chartrand, H. Kronk, Don Lick (1969)
Fundamenta Mathematicae
Similarity:
Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)
Divulgaciones Matemáticas
Similarity:
Tudor Zamfirescu (1971)
Rendiconti del Seminario Matematico della Università di Padova
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...
Enomoto, Hikoe, Katona, Gyula O.H. (2001)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ladislav Nebeský (1988)
Czechoslovak Mathematical Journal
Similarity:
Igor Fabrici, Erhard Hexel, Stanislav Jendrol’ (2013)
Discussiones Mathematicae Graph Theory
Similarity:
A nonempty vertex set X ⊆ V (G) of a hamiltonian graph G is called an H-force set of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The H-force number h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined.
D. Z. Du, D. F. Hsu (1989)
Banach Center Publications
Similarity: