The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2003, volume: 269, number: 1-3

  1. Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Akira Saito
    M-alternating paths in n-extendable bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:1-11 [Journal]
  2. Camino Balbuena, Daniela Ferrero
    Edge-connectivity and super edge-connectivity of P2-path graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:13-20 [Journal]
  3. Airat Bekmetjev, Graham Brightwell, Andrzej Czygrinow, Glenn Hurlbert
    Thresholds for families of multisets, with an application to graph pebbling. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:21-34 [Journal]
  4. Donald I. Cartwright, Patrick Solé, Andrzej Zuk
    Ramanujan geometries of type Ãn. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:35-43 [Journal]
  5. An Chang
    On the largest eigenvalue of a tree with perfect matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:45-63 [Journal]
  6. Gary Chartrand, David Erwin, Michael A. Henning, Peter J. Slater, Ping Zhang
    Graphs of order n with locating-chromatic number n-1. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:65-79 [Journal]
  7. Liang Chen, Naoyuki Tokuda
    n-Tokyoites' loop-line commuter problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:81-91 [Journal]
  8. Antonio di Nola, Ada Lettieri
    Finite BL-algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:93-112 [Journal]
  9. Grégory Duby
    Countable ultrahomogeneous antimatroids of convex dimension 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:113-125 [Journal]
  10. John P. Georges, David W. Mauro
    Labeling trees with a condition at distance two. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:127-148 [Journal]
  11. Mike J. Grannell, Terry S. Griggs, Vladimir P. Korzhik, Jozef Sirán
    On the minimal nonzero distance between triangular embeddings of a complete graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:149-160 [Journal]
  12. Manoel Lemos
    Uniqueness of the decomposition of the rank function of a 2-polymatroid. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:161-179 [Journal]
  13. WeiJun Liu
    Suzuki groups and automorphisms of finite linear spaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:181-190 [Journal]
  14. Arnaud Pêcher
    Partitionable graphs arising from near-factorizations of finite groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:191-218 [Journal]
  15. Jane G. Pitkethly
    Inherent dualisability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:219-237 [Journal]
  16. Manfred Schocker
    Idempotents for derangement numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:239-248 [Journal]
  17. Yang Yuansheng, Weifa Liang
    The minimum number of vertices with girth 6 and degree set D={r, m}. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:249-258 [Journal]
  18. Christian Bey
    An upper bound on the sum of squares of degrees in a hypergraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:259-263 [Journal]
  19. Yair Caro, Raphael Yuster
    2-connected graphs with small 2-connected dominating sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:265-271 [Journal]
  20. Anders Claesson, Chris D. Godsil, David G. Wagner
    A permutation group determined by an ordered set. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:273-279 [Journal]
  21. Yan-Quan Feng, Jin Ho Kwak
    An infinite family of cubic one-regular graphs with unsolvable automorphism groups. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:281-286 [Journal]
  22. Sylvain Gravier, Sandi Klavzar, Michel Mollard
    Isometric embeddings of subdivided wheels in hypercubes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:287-293 [Journal]
  23. Hong-Jian Lai, Xiangwen Li
    Small cycle cover of 2-connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:295-302 [Journal]
  24. Ko-Wei Lih, Wei-Fan Wang, Xuding Zhu
    Coloring the square of a K4-minor free graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:303-309 [Journal]
  25. Zhengke Miao
    Improper choosability of graphs embedded on the surface of genus r. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:311-314 [Journal]
  26. Jinsong Tan
    On Cheeger inequalities of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:315-323 [Journal]
  27. Stephanie van Willigenburg
    Properties of the descent algebras of type D. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:325-332 [Journal]
  28. Ibrahim Assem, María Inés Platzeck, María Julia Redondo, Sonia Trepode
    Simply connected incidence algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:269, n:1-3, pp:333-355 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002