DM
2008
13 years 11 months ago
2008
We consider the following question of Bollob
DM
2008
13 years 11 months ago
2008
For graphs G and H, let G H denote their Cartesian sum. This paper investigates the chromatic number and the circular chromatic number for GH. It is proved that (G H) max{ c(G)...
DM
2008
13 years 11 months ago
2008
A triangular grid graph is a finite induced subgraph of the infinite graph associated with the two-dimensional triangular grid. In 2000, Reay and Zamfirescu showed that all 2-conne...
DM
2008
13 years 11 months ago
2008
: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451
DM
2008
13 years 11 months ago
2008
This paper examines some of the properties of point-weight incidence structures, i.e. incidence structures for which every point is assigned a positive integer weight. In particul...
DM
2008
13 years 11 months ago
2008
DM
2008
13 years 11 months ago
2008
A matroid-like structure defined on a convex geometry, called a cg-matroid, is defined by S. Fujishige, G. A. Koshevoy, and Y. Sano in [9]. A cg-matroid whose rank function is nat...
DM
2008
13 years 11 months ago
2008
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique...
DM
2008
13 years 11 months ago
2008
Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi
DM
2008
13 years 11 months ago
2008
