✦ LIBER ✦

A Complete Solution of a Problem of Bondy Concerning Multipartite Tournaments

✍ Scribed by Yubao Guo; Lutz Volkmann

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 257 KB
Volume: 66
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1996.0010

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solution of a covering problem related t

Solution of a covering problem related to labelled tournaments

✍ Sgall, Ji?� 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 462 KB 👁 2 views

Suppose we have a tournament with edges labelled so that the edges incident with any vertex have at most k distinct labels (and no vertex has outdegree 0). Let m be the minimal size of a subset of labels such that for any vertex there exists an outgoing edge labelled by one of the labels in the subs

A Proof of a Conjecture of Bondy Concern

A Proof of a Conjecture of Bondy Concerning Paths in Weighted Digraphs

✍ B. Bollobás; A.D. Scott 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 365 KB

Our aim in this note is to prove a conjecture of Bondy, extending a classical theorem of Dirac to edge-weighted digraphs: if every vertex has out-weight at least 1 then the digraph contains a path of weight at least 1. We also give several related conjectures and results concerning heavy cycles in e

Concerning a problem of H. Scholz

✍ Andrzej Mostowski 📂 Article 📅 1956 🏛 John Wiley and Sons 🌐 English ⚖ 259 KB

CONCERNING A PROBLEM OF H. SCHOLZ By ANDRZEJ MOSTOWSKI in Warsxawa G . ASSER in his recent article [l] has established a number of interesting results pertaining to a problem proposed by H. SCHOLZ [2]. The results of ASSER overlap in part with results which I have found in 1953 while attempting (uns

The chromatic index of complete multipar

The chromatic index of complete multipartite graphs

✍ D. G. Hoffman; C. A. Rodger 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 266 KB

## Abstract We show that a complete multipartite graph is class one if and only if it is not eoverfull, thus determining its chromatic index.

On minimum sets of 1-factors covering a

On minimum sets of 1-factors covering a complete multipartite graph

✍ David Cariolaro; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

Maximal sets of hamilton cycles in compl

Maximal sets of hamilton cycles in complete multipartite graphs

✍ Mike Daven; J. A. MacDougall; C. A. Rodger 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 154 KB 👁 2 views

## Abstract A set __S__ of edge‐disjoint hamilton cycles in a graph __G__ is said to be __maximal__ if the edges in the hamilton cycles in __S__ induce a subgraph __H__ of __G__ such that __G__ − __E__(__H__) contains no hamilton cycles. In this context, the spectrum __S__(__G__) of a graph __G__ i