Premium
Note on the existence of directed ( k + 1)‐cycles in diconnected complete k ‐partite digraphs
Author(s) -
Balakrishnan R.,
Paulraja P.
Publication year - 1984
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190080310
Subject(s) - mathematics , combinatorics , graph , directed graph , discrete mathematics
A graph is constructed to provide a negative answer to the following question of Bondy: Does every diconnected orientation of a complete k ‐partite ( k ≥ 5) graph with each part of size at least 2 yield a directed ( k + 1)‐cycle?