DM 2008 | Sciweavers

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)...

Daphne Der-Fen Liu, Xuding Zhu

claim paper

Read More »

40

click to vote

DM
2008

86views more DM 2008»

Hamiltonian properties of triangular grid graphs

13 years 11 months ago

Download www.math.uni-magdeburg.de

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...

Valery S. Gordon, Yury L. Orlovich, Frank Werner

claim paper

Read More »

35

click to vote

DM
2008

123views more DM 2008»

Graphic sequences with a realization containing a generalized friendship graph

13 years 11 months ago

Download community.middlebury.edu

: Gould, Jacobson and Lehel (Combinatorics, Graph Theory and Algorithms, Vol.I (1999) 451

Jian-Hua Yin, Gang Chen, John R. Schmitt

claim paper

Read More »

16

click to vote

DM
2008

56views more DM 2008»

Point-weight designs with design conditions on t points

13 years 11 months ago

Download www.isg.rhul.ac.uk

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...

Alexander W. Dent

claim paper

Read More »

23

click to vote

DM
2008

65views more DM 2008»

Multiple extensions of a finite Euler's pentagonal number theorem and the Lucas formulas

13 years 11 months ago

Download www.math.ecnu.edu.cn

Victor J. W. Guo, Jiang Zeng

claim paper

Read More »

24

click to vote

DM
2008

55views more DM 2008»

Rank functions of strict cg-matroids

13 years 11 months ago

Download www.kurims.kyoto-u.ac.jp

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...

Yoshio Sano

claim paper

Read More »

25

click to vote

DM
2008

145views more DM 2008»

Clique coverings and partitions of line graphs

13 years 11 months ago

Download math.cts.ntu.edu.tw

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...

Bo-Jr Li, Gerard J. Chang

claim paper

Read More »

30

click to vote

DM
2008

92views more DM 2008»

Partial cubes: structures, characterizations, and constructions

13 years 11 months ago

Download online.sfsu.edu

Partial cubes are isometric subgraphs of hypercubes. Structures on a graph defined by means of semicubes, and Djokovi

Sergei Ovchinnikov