Sciweavers

Share
30 search results - page 2 / 6
» gc 2008
Sort
View
GC
2008
Springer
8 years 11 months ago
On the Acyclic Chromatic Number of Hamming Graphs
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...
Robert E. Jamison, Gretchen L. Matthews
GC
2008
Springer
8 years 11 months ago
On 2-Detour Subgraphs of the Hypercube
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 ...
József Balogh, Alexandr V. Kostochka
JGT
2008
107views more  JGT 2008»
8 years 11 months ago
On planar intersection graphs with forbidden subgraphs
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 ...
János Pach, Micha Sharir
CORR
2008
Springer
187views Education» more  CORR 2008»
8 years 11 months ago
Coalitions in Cooperative Wireless Networks
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...
Suhas Mathur, Lalitha Sankar, Narayan B. Mandayam
GC
2008
Springer
8 years 11 months ago
A Bijection for Eulerian-equivalence Classes of Totally Cyclic Orientations
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...
Beifang Chen, Arthur L. B. Yang, Terence Y. J. Zha...
books