Sciweavers

DM
2002
91views more  DM 2002»
13 years 3 months ago
A disproof of Henning's conjecture on irredundance perfect graphs
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...
Lutz Volkmann, Vadim E. Zverovich
DM
2002
96views more  DM 2002»
13 years 3 months ago
Chain polynomials and Tutte polynomials
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...
Lorenzo Traldi
DM
2002
83views more  DM 2002»
13 years 3 months ago
Sums of minima and maxima
Let h1,
Zhi-Wei Sun
DM
2002
101views more  DM 2002»
13 years 3 months ago
On generalized Ramsey numbers
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...
Wai Chee Shiu, Peter Che Bor Lam, Yusheng Li
DM
2002
84views more  DM 2002»
13 years 3 months ago
On incidence coloring for some cubic graphs
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 ...
Wai Chee Shiu, Peter Che Bor Lam, Dong-Ling Chen
DM
2002
68views more  DM 2002»
13 years 3 months ago
Edge-gracefulness of the composition of paths with null graphs
Wai Chee Shiu, Peter Che Bor Lam, Hee Lin Cheng
DM
2002
114views more  DM 2002»
13 years 3 months ago
Existence of resolvable group divisible designs with block size four I
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 ...
Hao Shen, Jiaying Shen
DM
2002
76views more  DM 2002»
13 years 3 months ago
Homeomorphs and amallamorphs of the Petersen graph
Hossein Shahmohamad, Earl Glen Whitehead Jr.
DM
2002
104views more  DM 2002»
13 years 3 months ago
A polynomial time algorithm for determining zero Euler-Petrie genus of an Eulerian graph
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...
Brigitte Servatius, Herman Servatius