๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Partitioning trees: Matching, domination, and maximum diameter

โœ Scribed by Arthur Parley; Stephen Hedetniemi; Andrzej Proskurowski

Book ID
105023836
Publisher
Springer
Year
1981
Tongue
English
Weight
329 KB
Volume
10
Category
Article
ISSN
1573-7640

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximum matchings and trees
Maximum matchings and trees
โœ Carla Savage ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 537 KB
Hamiltonicity, diameter, domination, pac
Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs
โœ David C. Fisher; Patricia A. McKenna; Elizabeth D. Boyer ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 785 KB

Let w(G), x(G), A(G), bp(G), diam(Gi), v(G), and y(G) be the clique number, chromatic number, adjacency matrix, biclique partition number, diameter, packing number, and domination number of a connected graph G. Mycielski constructed a graph g(G) with W@(G)) =w(G