3211 search results - page 9 / 643 » On the Grundy Number of a Graph |
GD
2006
Springer
13 years 11 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
AUIC
2005
IEEE
14 years 1 months ago
2005
IEEE
Thin-client diagramming tools provide a number of advantages over traditional thick-client design tools but are challenging to build. We describe an extension to a thick-client me...
AUIC
2005
IEEE
14 years 1 months ago
2005
IEEE
With the advent of the Tablet PC and stylus-based PDAs, sketching-based user interfaces for design tools have become popular. However, a major challenge with such interfaces is th...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
SOFSEM
2005
Springer
14 years 1 months ago
2005
Springer
An outerplanar (also called circular, convex, one-page) drawing of an n-vertex graph G is a drawing in which the vertices are placed on a circle and each edge is drawn using one s...