Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs. / Gutin, Gregory; Yeo, Anders.

In: Graphs and Combinatorics, Vol. 17, No. 3, 2001, p. 473-477.

Research output: Contribution to journalArticle

Published

Standard

Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs. / Gutin, Gregory; Yeo, Anders.

In: Graphs and Combinatorics, Vol. 17, No. 3, 2001, p. 473-477.

Research output: Contribution to journalArticle

Harvard

APA

Vancouver

Author

BibTeX

@article{44da2611165c451789e3e17ccacdee8a,
title = "Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs",
keywords = "digraph, multipartite, vertices, Volkmann, longest path, cycle,",
author = "Gregory Gutin and Anders Yeo",
year = "2001",
doi = "10.1007/s003730170022",
language = "English",
volume = "17",
pages = "473--477",
journal = "Graphs and Combinatorics",
issn = "1435-5914",
publisher = "Springer Japan",
number = "3",

}

RIS

TY - JOUR

T1 - Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs

AU - Gutin, Gregory

AU - Yeo, Anders

PY - 2001

Y1 - 2001

KW - digraph

KW - multipartite

KW - vertices

KW - Volkmann

KW - longest path

KW - cycle,

U2 - 10.1007/s003730170022

DO - 10.1007/s003730170022

M3 - Article

VL - 17

SP - 473

EP - 477

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

SN - 1435-5914

IS - 3

ER -