
	Where results make sense

Topic: Cocoloring

Related Topics

Graph coloring problem

Glossary of graph theory

List of graph theory topics

Graph coloring

	Week 3 Abstracts
		Given G, a graph, a cocoloring of G is a partition of V(G) where each part induces a complete or empty graph.
		The cochromatic number, z(G), of G is the minimum order of all cocolorings of G. We show that if G has genus n, then the cochromatic number of G is at most sqrt(n)/log (n)
		We will see this is related to the problem of finding the maximum chromatic number of all triangle-free graphs of genus n.
	dimacs.rutgers.edu /drei/1998/week3.html (3950 words)

	Reference.com/Encyclopedia/Subcoloring
		Subcoloring and subchromatic number were introduced by Albertson et al.
		It follows from its definition immediately that it is a kind of cocoloring.
		Since an independent set is also a disjoint union of induced cliques, namely K
	www.reference.com /browse/wiki/Subcoloring (190 words)

	Technical Report 007-2005
		Partitioning a permutation into a minimum number of monotone subsequences is NP-hard.
		For the associated online problem, in which the permutation becomes known to an algorithm sequentially, we derive a logarithmic lower bound on the competitive ratio for minimum monotone partitions, and we analyze two (bin packing) online algorithms.
		These findings immediately apply to online cocoloring of permutation graphs; they are the first results concerning online algorithms for this graph theoretical interpretation.
	www.math.tu-berlin.de /coga/publications/techreports/2005/Report-007-2005.html (213 words)

Try your search on: Qwika (all wikis)