✦ LIBER ✦

Application of structural numbers to graph partitioning

✍ Scribed by A. N. Melikhov; V. M. Kureichik; A. F. Kuznetsov

Book ID: 105057955
Publisher: Springer US
Year: 1977
Tongue: English
Weight: 505 KB
Volume: 12
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01070257

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Partition graphs and coloring numbers of

Partition graphs and coloring numbers of a graph

✍ E. Sampathkumar; V.N. Bhave 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 288 KB

Competition numbers of complete -partite

Competition numbers of complete -partite graphs

✍ Bo-Jr Li; Gerard J. Chang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Partitions of Numbers for Finding Certai

Partitions of Numbers for Finding Certain Graphs

✍ Fielder, Daniel C. 📂 Article 📅 1968 🏛 IEEE 🌐 English ⚖ 826 KB

On graphs critical with respect to verte

On graphs critical with respect to vertex partition numbers

✍ Peter Mihók 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 362 KB

For k 3 0, pk(G) den ot e s the Lick-White vertex partition number of G. A graph G is called (n, k)-critical 'f 't I I is connected and for each edge e of G Pk (G -e) < pk (G) = n. We describe all (2, k&critical graphs and for n 23, k 2 1 we extend and simplify a result of Bollobas and Harary giving

Edge domatic numbers of complete n- part

Edge domatic numbers of complete n- partite graphs

✍ Shiow-Fen Hwang; Gerard J. Chang 📂 Article 📅 1994 🏛 Springer Japan 🌐 English ⚖ 575 KB

Total chromatic number of complete r-par

Total chromatic number of complete r-partite graphs

✍ K. H. Chew; H. P. Yap 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 284 KB 👁 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par