✦ LIBER ✦

Multiple vertex coverings by specified induced subgraphs

✍ Scribed by Zoltán Füredi; Dhruv Mubayi; Douglas B. West

Publisher: John Wiley and Sons
Year: 2000
Tongue: English
Weight: 159 KB
Volume: 34
Category: Article
ISSN: 0364-9024
DOI: 10.1002/1097-0118(200006)34:2<180::aid-jgt7>3.0.co;2-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Multiple vertex coverings by cliques

✍ Wayne Goddard; Michael A. Henning 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 99 KB

For positive integers m 1 ; . . . ; m k , let f (m 1 ; . . . ; m k ) be the minimum order of a graph whose edges can be colored with k colors such that every vertex is in a clique of cardinality m i , all of whose edges have the ith color for all i ¼ 1; 2; . . . ; k. The value for k ¼ 2 was determin