3204 search results - page 190 / 641 » The b-chromatic Number of a Graph |
CCCG
2007
13 years 12 months ago
2007
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend during the course of the morph. The morph uses a polynomial ...
IJCAI
2003
13 years 11 months ago
2003
Automated verification is one of the most success ful applications of automated reasoning in com puter science. In automated verification one uses algorithmic techniques to es...
ENDM
2008
13 years 10 months ago
2008
We give an algorithm to morph between two planar drawings of a graph, preserving planarity, but allowing edges to bend. The morph uses a polynomial number of elementary steps, whe...
FFA
2006
13 years 10 months ago
2006
Applying results from partial difference sets, quadratic forms, and recent results of Brouwer and Van Dam, we construct the first known amorphic association scheme with negative La...
DM
2000
13 years 10 months ago
2000
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi