✦ LIBER ✦

On clique-colouring of graphs with fewP4’s

✍ Scribed by Klein, Sulamita; Morgana, Aurora

Book ID: 113109414
Publisher: SciELO
Year: 2011
Tongue: English
Weight: 387 KB
Volume: 18
Category: Article
ISSN: 0104-6500
DOI: 10.1007/s13173-011-0053-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hamiltonicity in graphs with fewP4's

✍ W. Hochstättler; G. Tinhofer 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 641 KB

Restricted coloring problems on Graphs w

Restricted coloring problems on Graphs with fewP4’s

✍ Linhares-Sales, Cláudia; Maia, Ana Karolinna; Martins, Nicolas; Sampaio, Rudini 📂 Article 📅 2014 🏛 Springer US 🌐 English ⚖ 313 KB

Colouring Clique-Hypergraphs of Circulan

Colouring Clique-Hypergraphs of Circulant Graphs

✍ C. N. Campos, S. Dantas, C. P. de Mello 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 202 KB

On iterated clique graphs with increasin

On iterated clique graphs with increasing diameters

✍ C. Peyrat; D. F. Rall; P. J. Slater 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB 👁 1 views

We examine the problem of finding a graph G whose nth iterated clique graph has diameter equal to the diameter of G plus n.

On the small graphs with chromatic numbe

On the small graphs with chromatic number 5 without 4-cliques

✍ Nedyalko D. Nenov 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 49 KB

On clique partitions of split graphs

✍ W.D. Wallis; J. Wu 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique