836 search results - page 2 / 168 » Orthogonal Colorings of Graphs |
GC
2008
Springer
13 years 5 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
CCCG
2010
13 years 7 months ago
2010
A set of n colored objects (points/hyperboxes) lie in IRd . Each object has a weight associated with it. Given a query orthogonal range q, for each distinct color c of the objects...
AAAI
2008
13 years 8 months ago
2008
We consider a multiagent extension of single-agent graph coloring. Multiple agents hold disjoint autonomous subgraphs of a global graph, and every color used by the agents in colo...
GD
2004
Springer
13 years 11 months ago
2004
Springer
Large graphs are difficult to browse and to visually explore. This note adds up evidence that some graph drawing techniques, which produce readable layouts when applied to medium-s...
COMBINATORICA
2007
13 years 5 months ago
2007
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...