𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalized k-tuple colorings of cycles and other graphs

✍ Scribed by R.C Brigham; R.D Dutton

Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
213 KB
Volume
32
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex colorings of graphs without short
Vertex colorings of graphs without short odd cycles
✍ Andrzej Dudek; Reshma Ramadurai πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 118 KB πŸ‘ 1 views

Motivated by the work of NeΕ‘etΕ™il and R ΓΆdl on "Partitions of vertices" we are interested in obtaining some quantitative extensions of their result. In particular, given a natural number r and a graph G of order m with odd girth g, we show the existence of a graph H with odd girth at least g and ord

Algorithms for maximum k-colorings and k
Algorithms for maximum k-colorings and k-coverings of transitive graphs
✍ Fǎnicǎ Gavril πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 356 KB

Consider a graph G and a positive integer k. The maximum k-coloring problem is to color a maximum number of vertices using k colors, such that no two adjacent vertices have the same color. The maximum k-covering problem is to find k disjoint cliques covering a maximum number of vertices. The present