✦ LIBER ✦

Generalized n-tuple colorings of a graph: A counterexample to a conjecture of Brigham and Dutton

✍ Scribed by Abdelkader Khelladi; Charles Payan

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 277 KB
Volume: 37
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(84)90061-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A counterexample to a conjecture on the

A counterexample to a conjecture on the bondage number of a graph

✍ Ulrich Teschner 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 113 KB

The bondage number h(G) of a nonempty graph G was first introduced by Fink, Jacobson, Kinch and Roberts in [3]. They generalized a former approach to domination-critical graphs, In their publication they conjectured that b(G)<d(G)+ 1 for any nonempty graph G.

A counterexample to a conjecture of meyn

A counterexample to a conjecture of meyniel on kernel-perfect graphs

✍ Hortensia Galeana-Sánchez 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A counterexample to a conjecture of Edmo

A counterexample to a conjecture of Edmonds and Giles

✍ A. Schrijver 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 100 KB

Hopf Algebras and a Counterexample to a

Hopf Algebras and a Counterexample to a Conjecture of Anick

✍ Y. Felix; S. Halperin; J.C. Thomas 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 668 KB

A counterexample to a conjecture on path

A counterexample to a conjecture on paths of bounded length

✍ Stephanie M. Boyles; Geoffrey Exoo 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract In a recent paper Lovász, Neumann‐Lara, and Plummer studied Mengerian theorems for paths of bounded length. Their study led to a conjecture concerning the extent to which Menger's theorem can fail when restricted to paths of bounded length. In this paper we offer counterexamples to this

Covers in Uniform Intersecting Families

Covers in Uniform Intersecting Families and a Counterexample to a Conjecture of Lovász

✍ Peter Frankl; Katsuhiro Ota; Norihide Tokushige 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 446 KB

We discuss the maximum size of uniform intersecting families with covering number at least {. Among others, we construct a large k-uniform intersecting family with covering number k, which provides a counterexample to a conjecture of Lova sz. The construction for odd k can be visualized on an annulu