A note on the number of Hamiltonian paths in strong tournaments.

Busch, Arthur H.

Displaying similar documents to “A note on the number of Hamiltonian paths in strong tournaments.”

Nonderogatory unicyclic digraphs.

Bravo, Diego, Rada, Juan (2007)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Remarks on Hamiltonian properties of squares of graphs

Günter Schaar (1989)

Archivum Mathematicum

Similarity:

Randomly hamiltonian digraphs

G. Chartrand, H. Kronk, Don Lick (1969)

Fundamenta Mathematicae

Similarity:

Hamiltonian virus-free digraphs.

Ordaz, Oscar, González, Leida, Márquez, Isabel, Quiroz, Domingo (2000)

Divulgaciones Matemáticas

Similarity:

On $k$ -path hamiltonian graphs and line-graphs

Tudor Zamfirescu (1971)

Rendiconti del Seminario Matematico della Università di Padova

Similarity:

Independent Detour Transversals in 3-Deficient Digraphs

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...

Pairs of disjoint $q$ -element subsets far from each other.

Enomoto, Hikoe, Katona, Gyula O.H. (2001)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

Embedding $m$ -quasistars into $n$ -cubes

Ladislav Nebeský (1988)

Czechoslovak Mathematical Journal

Similarity: