Gutin, Gregory (1995) Characterizations of vertex pancyclic and pancyclic ordinary semicomplete multipartite digraphs. Discrete Mathematics, 141
Full text access: Open
A digraph obtained by replacing each edge of a complete multipartite graph by an arc or a pair of mutually opposite arcs with the same end vertices is called a complete multipartite graph. Such a digraph D is called ordinary if for any pair X, Y of its partite sets the set of arcs with both end vertices in X Y coincides with X × Y = {(x, y): xX, yY} or Y × X or X × Y Y × X. We characterize all the pancyclic and vertex pancyclic ordinary complete multipartite graphs. Our charcterizations admit polynomial time algorithms.
This is a Submitted version This version's date is: 1995 This item is not peer reviewed
https://repository.royalholloway.ac.uk/items/e3c4c88d-fb88-f762-3939-020545cbfe87/3/
Deposited by Research Information System (atira) on 25-Jul-2012 in Royal Holloway Research Online.Last modified on 25-Jul-2012