1749 search results - page 123 / 350 » Conditional colorings of graphs |
173
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Graph transformation is concerned with the manipulation of graphs by means of rules. Graph grammars have been traditionally studied using techniques from category theory. In previ...
164
click to vote
STACS
2007
Springer
16 years 20 days ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
181
click to vote
ADS
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we describe how to generate affective dialogs for multiple virtual characters based on a combination of both automatically generated and pre-scripted scenes. This is ...
214
click to vote
FSTTCS
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. We present fast distributed algorithms for coloring and (connected) dominating set construction in wireless ad hoc networks. We present our algorithms in the context of U...
172
click to vote
DAM
2010
15 years 6 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...