✦ LIBER ✦

Structures and Chromaticity of Extremal 3-Colourable Sparse Graphs

✍ Scribed by F.M. Dong; K.M. Koh; K.L. Teo

Publisher: Springer Japan
Year: 2001
Tongue: English
Weight: 235 KB
Volume: 17
Category: Article
ISSN: 0911-0119
DOI: 10.1007/pl00007254

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The complexity of counting colourings an

The complexity of counting colourings and independent sets in sparse graphs and hypergraphs

✍ C. Greenhill 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 312 KB

Algebraic structure of chromatic graphs

Algebraic structure of chromatic graphs associated with the ramsey number N(3,3,3;2)

✍ Earl Glen Whitehead Jr. 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 116 KB

Digraph extremal problems, hypergraph ex

Digraph extremal problems, hypergraph extremal problems, and the densities of graph structures

✍ W.G Brown; M Simonovits 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 747 KB

We consider extremal problems 'of Tur~ type' for r-uniform ordered hypergraphs, where multiple oriented edges are permitted up to multiplicity q. With any such '(r, q)-graph' G" we associate an r-linear form whose maximum over the standard (n -1)-simplex in R" is called the (graph-) density g(G ") o

Sharp bounds for the number of 3-indepen

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

✍ F. M. Dong; K. M. Koh; K. L. Teo; C. H. C. Little; M. D. Hendy 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract Given a graph __G__ and an integer __k__ ≥ 1, let α(__G, k__) denote the number of __k__‐independent partitions of __G__. Let 𝒦^−s^(__p,q__) (resp., 𝒦~2~^−s^(__p,q__)) denote the family of connected (resp., 2‐connected) graphs which are obtained from the complete bipartite graph __K~p,q

The Structure of Hereditary Properties a

The Structure of Hereditary Properties and Colourings of Random Graphs

✍ Béla Bollobás; Andrew Thomason 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 418 KB

Coloured knots and coloured graphs repre

Coloured knots and coloured graphs representing 3-fold simple coverings of %plane1D;54A;3

✍ Mari Rita Casali 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 525 KB

It is well-known that every closed orientable 3-manifold M 3 is the 3-fold simple covering M3(K,o)) of S 3 branched over a knot K: hence, M 3 may be visualized by the associated coloured knot (K, co). On the other hand, PL-manifolds of arbitrary dimension may be represented by coloured graphs, via p