Name
Abstract | ||
|---|---|---|
Given a system (G(1), ..., G(m)) of graphs on the same vertex set V, a cooperative coloring is a choice of vertex sets I-1, ..., I-m, such that I-j is independent in G(j) and U-j=(1)m I-j = V. For a class g of graphs, let m(g)(d) be the minimal rn such that every m graphs from g with maximum degree d have a cooperative coloring. We prove that Omega(log log d) <= m(T) (d) <= O(log d) and Omega(log d) <= m(B) (d) <= O(d/log d), where T is the class of trees and B is the class of bipartite graphs. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.37236/8111 | ELECTRONIC JOURNAL OF COMBINATORICS |
Field | DocType | Volume |
Graph,Discrete mathematics,Combinatorics,Vertex (geometry),Bipartite graph,Degree (graph theory),Mathematics | Journal | 27 |
Issue | ISSN | Citations |
1 | 1077-8926 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ron Aharoni I | 1 | 13 | 8.92 |
| Eli Berger | 2 | 182 | 52.72 |
| Maria Chudnovsky | 3 | 390 | 46.13 |
| Frédéric Havet | 4 | 433 | 55.15 |
| Zilin Jiang | 5 | 0 | 0.68 |