Abstract
Given a system of graphs on the same vertex set , a cooperative coloring is a choice of vertex sets , such that is independent in and . For a class of graphs, let be the minimal such that every graphs from with maximum degree have a cooperative coloring. We prove that and , where is the class of trees and is the class of bipartite graphs.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.