✦ LIBER ✦

The existence problem for colour critical linear hypergraphs

✍ Scribed by H. L. Abbott; A. C. Liu

Book ID: 105394252
Publisher: Akadmiai Kiad
Year: 1978
Tongue: English
Weight: 545 KB
Volume: 32
Category: Article
ISSN: 1588-2632
DOI: 10.1007/bf01902363

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The enumeration problem for color critic

The enumeration problem for color critical linear hypergraphs

✍ H.L Abbott; A Liu; B Toft 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 682 KB

On the Number of Edges in Colour-Critica

On the Number of Edges in Colour-Critical Graphs and Hypergraphs

✍ A. V. Kostochka; M. Stiebitz 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 189 KB

The existence of the solution for linear

The existence of the solution for linear complementary problem

✍ Kou Shushun 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 141 KB

Critical hypergraphs for the weak chroma

Critical hypergraphs for the weak chromatic number

✍ C Benzaken 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 732 KB

On the Number of Edges in Hypergraphs Cr

On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings

✍ Alexandr V. Kostochka; Douglas R. Woodall 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 94 KB

A colouring of the vertices of a hypergraph G is called strong if, for every edge A, the colours of all vertices in A are distinct. It corresponds to a colouring of the generated graph (G) obtained from G by replacing every edge by a clique. We estimate the minimum number of edges possible in a k-cr

The complexity of the empire colouring p

The complexity of the empire colouring problem for linear forests

✍ McGrae, Andrew R.A.; Zito, Michele 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 457 KB