2283 search results - page 75 / 457 » Bounds of Graph Characteristics |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
DAM
2008
13 years 8 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
DAM
2008
13 years 8 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
DM
2008
13 years 8 months ago
2008
In this paper, the total chromatic number and fractional total chromatic number of circulant graphs are studied. For cubic circulant graphs we give upper bounds on the fractional ...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...