Publisher: Elsevier

Related content
Volume 259, Number 1, 28 December 2002

< previous issue | all issues | next issue >

Favourites:Add to Favourites

Editorial board
pp. v-vii(3)

Favourites:Add to Favourites
Favourites:Add to Favourites

Restricted permutations and the wreath product
pp. 19-36(18)
Authors: Atkinson, M.D.; Stitt, T.

Favourites:Add to Favourites

Equimodular curves
pp. 37-57(21)
Author: Biggs, N.

Favourites:Add to Favourites

Balanced nested designs and balanced arrays
pp. 91-119(29)
Authors: Fuji-Hara, R.; Kageyama, S.; Kuriki, S.; Miao, Y.; Shinohara, S.

Favourites:Add to Favourites

Kernels in digraphs with covering number at most 3
pp. 121-135(15)
Author: Galeana-Sanchez, H.

Favourites:Add to Favourites

Factoring the cartesian product of a cubic graph and a triangle
pp. 137-146(10)
Authors: Horton, J.D.; Wallis, W.D.

Favourites:Add to Favourites

Connected matroids with a small circumference
pp. 147-161(15)
Author: Junior, B.M.

Favourites:Add to Favourites

On the rank polynomial of the lattice of order ideals of fences and crowns
pp. 163-177(15)
Authors: Munarini, E.; Zagaglia Salvi, N.

Favourites:Add to Favourites

Searching for semifield flocks
pp. 179-188(10)
Author: Pinneri, I.

Favourites:Add to Favourites

The homomorphism problem for the free monoid
pp. 189-200(12)
Author: Silva, P.V.

Favourites:Add to Favourites

A characterization of additive sets
pp. 201-210(10)
Author: Vallejo, E.

Favourites:Add to Favourites

Diameter-essential edges in a graph
pp. 211-225(15)
Authors: Walikar, H.B.; Buckley, F.; Itagi, M.K.

Favourites:Add to Favourites

Independence and connectivity in 3-domination-critical graphs
pp. 227-236(10)
Authors: Zhang, L.; Tian, F.

Favourites:Add to Favourites
Favourites:Add to Favourites

On a question regarding visibility of lattice points-III
pp. 251-256(6)
Authors: Adhikari, S.D.; Chen, Y.

Favourites:Add to Favourites

Independence, irredundance, degrees and chromatic number in graphs
pp. 257-262(6)
Authors: Bacso, G.; Favaron, O.

Favourites:Add to Favourites

C4-saturated bipartite graphs
pp. 263-268(6)
Authors: Bryant, D.E.; Fu, H.

Favourites:Add to Favourites

Partial k-trees with maximum chromatic number
pp. 269-276(8)
Author: Chlebkova, J.

Favourites:Add to Favourites
Favourites:Add to Favourites

On the reconstruction of the degree sequence
pp. 293-300(8)
Authors: Delorme, C.; Favaron, O.; Rautenbach, D.

Favourites:Add to Favourites

K1,k-factorization of complete bipartite graphs
pp. 301-306(6)
Authors: Du, B.; Wang, J.

Favourites:Add to Favourites

A note about the dominating circuit conjecture
pp. 307-309(3)
Authors: Fleischner, H.; Kochol, M.

Favourites:Add to Favourites

On generalized Petersen graphs labeled with a condition at distance two
pp. 311-318(8)
Authors: Georges, J.P.; Mauro, D.W.

Favourites:Add to Favourites

A closure concept in factor-critical graphs
pp. 319-324(6)
Author: Nishimura, T.

Favourites:Add to Favourites

Independent domination and matchings in graphs
pp. 325-330(6)
Authors: Rautenbach, D.; Volkmann, L.

Favourites:Add to Favourites

Reconstruction up to isometries
pp. 331-336(6)
Authors: Rautenbach, D.; Triesch, E.

Favourites:Add to Favourites
Favourites:Add to Favourites
Favourites:Add to Favourites

An inequality between the diameter and the inverse dual degree of a tree
pp. 351-358(8)
Authors: Siu, M.; Zhang, Z.; Zhou, S.

Favourites:Add to Favourites

An intersection graph of straight lines
pp. 359-360(2)
Author: Thomassen, C.

Favourites:Add to Favourites

Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs
pp. 361-368(8)
Authors: Togasaki, M.; Yamazaki, K.

Favourites:Add to Favourites

Graphs with chromatic polynomial ?l=<m0lm0-l()l
pp. 369-381(13)
Authors: Ye, C.; Li, N.

Favourites:Add to Favourites
Favourites:Add to Favourites

Author index
pp. 387-388(2)

Share Content

Access Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content
Cookie Policy
X
Cookie Policy
ingentaconnect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more