An extremal problem for some classes of oriented graphs
K. Howalla, Abdallah N. Dabboucy, R. Tout (1983)
Časopis pro pěstování matematiky
Similarity:
Displaying similar documents to “On the maximum number of arcs in some classes of graphs”
An extremal problem for some classes of oriented graphs
On partially directed -graphs
Pavol Híc (1984)
Mathematica Slovaca
Similarity:
On the crossing numbers of and
Stanislav Jendroľ, Mária Ščerbová (1982)
Časopis pro pěstování matematiky
Similarity:
Every 8-Traceable Oriented Graph Is Traceable
Susan A. van Aardt (2017)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph of order n is k-traceable if n ≥ k and each of its induced subdigraphs of order k is traceable. It is known that if 2 ≤ k ≤ 6, every k-traceable oriented graph is traceable but for k = 7 and for each k ≥ 9, there exist k-traceable oriented graphs that are nontraceable. We show that every 8-traceable oriented graph is traceable.