260 search results - page 16 / 52 » Degree constrained subgraphs |
DM
2008
13 years 7 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
EJC
2002
13 years 7 months ago
2002
In this short note the neighbourhood graph of a Cayley graph is considered. It has as nodes a symmetric generating set of a finitely-generated group . Two nodes are connected by a...
DAGSTUHL
1997
13 years 8 months ago
1997
Finding one’s way through a complex virtual environment is a standard task in 3D graphics and virtual reality applications. Constrained navigation is a method that appropriately...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Planning collision-free paths for multiple robots traversing a shared space is a problem that grows combinatorially with the number of robots. The naive centralised approach soon ...
SIAMDM
2008
13 years 7 months ago
2008
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...