Skip to search formSkip to main contentSkip to account menu

Cocoloring

Known as: Cochromatic number 
In graph theory, a cocoloring of a graph G is an assignment of colors to the vertices such that each color class forms an independent set in G or in… 
Wikipedia (opens in a new tab)

Related topics

Related topics

6 relations
Clique (graph theory)ColorGraph theoryIndependent set (graph theory)

Broader (1)

Graph coloring

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2014
Review
2014
Cliques and stable sets in undirected graphs
  • M. Chudnovsky
  • Geometry, Structure and Randomness in…
  • 2014
  • Corpus ID: 44786916
The cochromatic number of a graph G is the minimum number of stable sets and cliques of G covering the vertex-set of G. In this… 
2011
2011
Classification of graphs based on the edge-cochromatic number
The bound of the edge-cochromatic number is given by means of Lowell Beineke and Richard Ringeisen.We offer the graph… 
2010
2010
The Parameterized Complexity of Stabbing Rectangles
The NP-complete geometric covering problem Rectangle Stabbing is defined as follows: Given a set R of axis-parallel rectangles in… 
2009
2009
Partitioning graphs into complete and empty graphs
2008
2008
Edge-cochromatic number of S_m∨P_n and S_m∨C_n
Based on the bound of edge-cochromatic number given by Lowell Beineke and Richard Ringeisen,the edge-cochromatic number of S m∨P… 
1989
1989
Critically cochromatic graphs
A graph G is critically n-cochromatic if (its cochromatic number) z(G) = n and z(G - v) = n - 1 for every vertex v of G… 
1987
1987
Some topics in cochromatic theory
GivenG, a graph, the cochromatic number,Z(G), ofG is the fewest number of sets into which the vertex set can be partitioned so… 
1986
1986
Uniquely cocolourable graphs
A graphG is uniquelyn-cocolourable if (its cochromatic number)z(G) = n and alln-cocolourings ofG induce the same partition of its… 
1980
1980
Note on the cochromatic number of several surfaces
The cochromatic number of a graph G, denoted by z(G), is the minimum number of subsets into which the vertex set of G can be… 
1979
1979
Cochromatic Number and the Genus of a Graph
The cochromatic number of a graph G, denoted by z(G), is the minimum number of subsets into which the vertex set of G can be… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)