Join Our Newsletter

30 search results - page 2 / 6» gc 2008 |

GC

2008

Springer

8 years 11 months ago
2008

Springer

An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...

GC

2008

Springer

8 years 11 months ago
2008

Springer

A spanning subgraph H of a graph G is a 2-detour subgraph of G if for each x, y V (G), dH (x, y) dG(x, y) + 2. We prove a conjecture of Erdos, Hamburger, Pippert, and Weakley by ...

JGT

2008

8 years 11 months ago
2008

Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...

CORR

2008

Springer

8 years 11 months ago
2008

Springer

Cooperation between rational users in wireless networks is studied using coalitional game theory. Using the rate achieved by a user as its utility, it is shown that the stable coal...

GC

2008

Springer

8 years 11 months ago
2008

Springer

Gioan showed that the number of cycle reversing classes of totally cyclic orientations of a given graph can be calculated as an evaluation of the corresponding Tutte polynomial. We...