836 search results - page 36 / 168 » Orthogonal Colorings of Graphs |
114
Voted
FSTTCS
2000
Springer
15 years 5 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
158
Voted
IPL
2006
15 years 1 months ago
2006
A homomorphism from an oriented graph G to an oriented graph H is an arc-preserving mapping from V (G) to V (H), that is (x)(y) is an arc in H whenever xy is an arc in G. The orie...
127
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
125
click to vote
WG
2001
Springer
15 years 6 months ago
2001
Springer
In a graph coloring, each color class induces a disjoint union of isolated vertices. A graph subcoloring generalizes this concept, since here each color class induces a disjoint un...
116
Voted
DAM
2002
15 years 1 months ago
2002
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...