𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Coloring the hypergraph of maximal cliques of a graph with no long path

✍ Scribed by Sylvain Gravier; Chı́nh T. Hoàng; Frédéric Maffray

Book ID
108315902
Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
116 KB
Volume
272
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Coloring the Maximal Cliques of Graphs
Coloring the Maximal Cliques of Graphs
✍ Bacsó, Gábor; Gravier, Sylvain; Gyárfás, András; Preissmann, Myriam; Sebo, Andrá 📂 Article 📅 2004 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 195 KB
On the partition and coloring of a graph
On the partition and coloring of a graph by cliques
✍ W.D. Wallis; Guo-Hui Zhang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 859 KB

Wallis, W.D. and G.-H. Zhang, On the partition and coloring of a graph by cliques, Discrete Mathematics 120 (1993) 191-203. We first introduce the concept of the k-chromatic index of a graph, and then discuss some of its properties. A characterization of the clique partition number of the graph G V

Maximal cliques in the Paley graph of sq
Maximal cliques in the Paley graph of square order
✍ R.D. Baker; G.L. Ebert; J. Hemmeter; A. Woldar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 424 KB

Determining the clique number of the Paley graph of order q, 4 E I (mod 4) a prime power, is a difficult problem. However, the work of Blokhuis implies that in the Paley graph of order q2, where q is any odd prime power, the clique number is in fact q. In this paper we construct maximal cliques of s