default search action
Discrete Mathematics, Volume 278
Volume 278, Number 1-3, March 2004
- Kathie Cameron:
Induced matchings in intersection graphs. 1-9 - Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi:
Roman domination in graphs. 11-22 - Edward Dobson, Mateja Sajna:
Almost self-complementary circulant graphs. 23-44 - Andrzej Ehrenfeucht, Tero Harju, Grzegorz Rozenberg:
Transitivity of local complementation and switching on graphs. 45-60 - Sylvain Gravier, Jeannette C. M. Janssen, Kyriakos Kilakos, Sulamita Klein:
Graph covers using t-colourable vertex sets. 61-80 - Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle:
Iterated colorings of graphs. 81-108 - Michael A. Henning:
Signed total domination in graphs. 109-125 - Arne Hoffmann, Lutz Volkmann:
On unique k-factors and unique [1, k]-factors in graphs. 127-138 - Lei Hu, Dingyi Pei:
Generator polynomials of characteristic ideal of maximal periodic arrays over Galois rings. 139-149 - Katharina T. Huber:
Recovering trees from well-separated multi-state characters. 151-164 - Martin Kochol:
Snarks and flow-snarks constructed from coloring-snarks. 165-174 - Selda Küçükçifçi, Charles C. Lindner, Alexander Rosa:
The metamorphosis of lambda-fold block designs with block size four into a maximum packing of lambdaKn with 4-cycles. 175-193 - Ju-Mok Oh, Kyung-Won Hwang:
Construction of one-regular graphs of valency 4 and 6. 195-207 - Y. H. Peng, Gee-Choon Lau:
Chromatic classes of 2-connected (n, n+4)-graphs with at least four triangles. 209-218 - Akira Saito, Tomoki Yamashita:
Cycles within specified distance from each vertex. 219-226 - Nicholas Weaver:
The Kadison-Singer problem in discrepancy theory. 227-239 - Xiao-Dong Zhang:
Bipartite graphs with small third Laplacian eigenvalue. 241-253
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.