3268 search results - page 9 / 654 » The hub number of a graph |
GC
2008
Springer
13 years 9 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...
IPL
2008
13 years 9 months ago
2008
We use transfer matrix methods to determine bounds for the numbers of legal Go positions for various numbers of players on some planar lattice graphs, including square lattice gra...
ECIR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional “resource ...
SIAMDM
2008
13 years 9 months ago
2008
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
GD
2005
Springer
14 years 3 months ago
2005
Springer
The crossing number of a graph is the minimum number of edge intersections in a plane drawing of a graph, where each intersection is counted separately. If instead we count the nu...