Hamilton Paths in Multipartite Oriented Graphs
Review articleOpen access

In this paper, the following results will be shown:1There is a Hamilton path and a cycle of length at least p—1 in any regular multipartite tournament of order p;(i)There is a longest path UO,…, ut in any oriented graph such that d−(uO) + d+(ut) ≤ t.

Request full text

References (0)

Cited By (0)

No reference data.
No citation data.
Join Copernicus Academic and get access to over 12 million papers authored by 7+ million academics.
Join for free!