𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colouring Clique-Hypergraphs of Circulant Graphs

✍ Scribed by C. N. Campos, S. Dantas, C. P. de Mello

Book ID
120788782
Publisher
Springer Japan
Year
2013
Tongue
English
Weight
202 KB
Volume
29
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graph properties and hypergraph colourin
Graph properties and hypergraph colourings
✍ Jason I. Brown; Derek G. Corneil πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 855 KB

Given a graph property P, graph G and integer k 20, a P k-colouring of G is a function Jr:V(G)+ (1,. . ) k} such that the subgraph induced by each colour class has property P. When P is closed under induced subgraphs, we can construct a hypergraph HG such that G is P k-colourable iff Hg is k-colou

The maximal clique and colourability of
The maximal clique and colourability of curve contact graphs
✍ Petr HlineΛ‡nΓ½ πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 669 KB

## Contact graphs are a special kind of intersection graphs of geometrical objects in which the objects are not allowed to cross but only to touch each other. Contact graphs of simple curves, and line segments as a special case, in the plane are considered. The curve contact representations are st