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

Gregory Gutin; Anders Yeo

doi:10.1007/s003730170022

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

Gregory Gutin, Anders Yeo

Department of Computer Science

Research output: Contribution to journal › Article

64 Downloads (Pure)

Original language	English
Pages (from-to)	473-477
Journal	Graphs and Combinatorics
Volume	17
Issue number	3
DOIs	https://doi.org/10.1007/s003730170022
Publication status	Published - 2001

Keywords

digraph
multipartite
vertices
Volkmann
longest path
cycle,

Access to Document

10.1007/s003730170022

Full Text

http://www.springerlink.com/content/101790/

Cite this

@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",

}

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

SN - 1435-5914

VL - 17

SP - 473

EP - 477

JO - Graphs and Combinatorics

JF - Graphs and Combinatorics

IS - 3

ER -