DM
2002
13 years 11 months ago
2002
Let ir(G) and (G) be the irredundance number and the domination number of a graph G, respectively. A graph G is called irredundance perfect if ir(H) = (H), for every induced subgr...
DM
2002
13 years 11 months ago
2002
The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
Let h1,
DM
2002
13 years 11 months ago
2002
Let f1 and f2 be graph parameters. The Ramsey number r(f1 m; f2 n) is defined as the minimum integer N such that any graph G on N vertices, either f1(G) m or f2(G) n. A genera...
DM
2002
13 years 11 months ago
2002
In 1993, Brualdi and Massey conjectured that every graph can be incidence colored with + 2 colors, where is the maximum degree of a graph. Although this conjecture was solved in ...
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
It is proved in this paper that for m 0; 2; 6; 10 (mod 12) there exists a resolvable group divisible design of order v, block size 4 and group size m if and only v 0 (mod 4), v ...
DM
2002
13 years 11 months ago
2002
DM
2002
13 years 11 months ago
2002
A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual grap...