✦ LIBER ✦

Counterexamples to Q-matrix conjectures

✍ Scribed by Walter D. Morris Jr.

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 564 KB
Volume: 111
Category: Article
ISSN: 0024-3795
DOI: 10.1016/0024-3795(88)90055-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Counterexamples to two conjectures of Hi

Counterexamples to two conjectures of Hilton

✍ S. Fiorini 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 122 KB

## Abstract Counterexamples are presented to the following two conjectures of Hilton: A graph which does not contain a spanning __K__~1t~ is Vl‐critical if and only if it is VC‐critical. If __G__ is a class‐two graph which contains a spanning Pl‐critical subgraph __H__ of the same chromatic index

Chaotic Polynomial Automorphisms: Counte

Chaotic Polynomial Automorphisms: Counterexamples to Several Conjectures

✍ Arno van den Essen; Engelbert Hubbers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We give a polynomial counterexample to a discrete version of the Markus᎐Yamabe conjecture and a conjecture of Deng, Meisters, and Zampieri, Ž . asserting that if F: ‫ރ‬ ª ‫ރ‬ is a polynomial map with det JF g ‫,\*ރ‬ then for all g ‫ޒ‬ large enough, F is global analytic linearizable. These counterex

Counterexamples to two conjectures about

Counterexamples to two conjectures about distance sequences

✍ Mark E. Watkins; James B. Shearer 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 558 KB

Counterexamples to three conjectures con

Counterexamples to three conjectures concerning perfect graphs

✍ Stefan Hougardy 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB

We will present counterexamples to a conjecture of Hoang on alternately orientable graphs, a conjecture of Hertz and de Werra on even pairs and to a conjecture of Reed on Berge graphs. All these three conjectures are related to perfect graphs.

Counterexamples to Robertson's conjectur

Counterexamples to Robertson's conjecture

✍ F.W Steutel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 184 KB

A counterexample to the bold conjecture

✍ Sakuma, Tadashi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 83 KB 👁 1 views

A pair of vertices (x, y) of a graph G is an ω-critical pair if ω(G + xy) > ω(G), where G + xy denotes the graph obtained by adding the edge xy to G and ω(H) is the clique number of H. The ω-critical pairs are never edges in G. A maximal stable set S of G is called a forced color class of G if S mee