1749 search results - page 159 / 350 » Conditional colorings of graphs |
154
click to vote
ISCC
2006
IEEE
16 years 19 days ago
2006
IEEE
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
198
Voted
IPL
2008
15 years 6 months ago
2008
Abstract. A stochastic graph game is played by two players on a game graph with probabilistic transitions. We consider stochastic graph games with -regular winning conditions speci...
159
click to vote
GD
2004
Springer
16 years 7 hour ago
2004
Springer
Consider the following question: does every complete geometric graph K2n have a partition of its edge set into n plane spanning trees? We approach this problem from three directio...
169
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. Asteroidal triples play a central ...
153
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...