Journals in DBLP

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

1. A. Benkouar, Yannis Manoussakis, Rachid Saad
   The number of 2-edge-colored complete graphs with unique hamiltonian alternating cycle. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:1-10 [Journal]
   
2. Dumitru Busneag
   On extensions of pseudo-valuations on Hilbert algebras. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:11-24 [Journal]
   
3. Gary Chartrand, David Erwin, Garry L. Johns, Ping Zhang
   Boundary vertices in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:25-34 [Journal]
   
4. Timothy Y. Chow
   Symplectic matroids, independent sets, and signed graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:35-45 [Journal]
   
5. William C. Coffman, S. Louis Hakimi, Edward F. Schmeichel
   Bounds for the chromatic number of graphs with partial information. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:47-59 [Journal]
   
6. Robert G. Donnelly, Scott J. Lewis, Robert Pervine
   Constructions of representations of o(2n+1, C) that imply Molev and Reiner-Stanton lattices are strongly Sperner. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:61-79 [Journal]
   
7. T. Aaron Gulliver, Masaaki Harada, Jon-Lark Kim
   Construction of new extremal self-dual codes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:81-91 [Journal]
   
8. Michael A. Henning
   Total domination excellent trees. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:93-104 [Journal]
   
9. Fred B. Holt
   Maximal nonrevisiting paths in simple polytopes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:263, n:1-3, pp:105-128 [Journal]
   
10. Frank K. Hwang, J. S. Lee, Y. C. Liu, Uriel G. Rothblum
    Sortability of vector partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:129-142 [Journal]
    
11. Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
    Root cases of large sets of t-designs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:143-155 [Journal]
    
12. Sandi Klavzar, Alenka Lipovec
    Partial cubes as subdivision graphs and as generalized Petersen graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:157-165 [Journal]
    
13. Yong Hah Lee
    Rough isometry and energy finite solutions of the Schro"dinger operator on graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:167-177 [Journal]
    
14. Vadim E. Levit, Eugen Mandrescu
    On alpha⁺-stable Ko"nig-Egerváry graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:179-190 [Journal]
    
15. Sheng-Chyang Liaw, Zhishi Pan, Xuding Zhu
    Construction of K_n-minor free graphs with given circular chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:191-206 [Journal]
    
16. Terry A. McKee
    Dualizing chordal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:207-219 [Journal]
    
17. Terry A. McKee
    Restricted circular-arc graphs and clique cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:221-231 [Journal]
    
18. Gelasio Salazar
    Small meshes of curves and their role in the analysis of optimal meshes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:233-246 [Journal]
    
19. Wolfgang Steiner
    Generalized de Bruijn digraphs and the distribution of patterns in ?-expansions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:247-268 [Journal]
    
20. Dragic Bankovic
    Distance in Post algebras. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:269-274 [Journal]
    
21. Sylvie Corteel, Carla D. Savage
    Anti-Lecture Hall Compositions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:275-280 [Journal]
    
22. M. H. Eggar
    A tournament problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:281-288 [Journal]
    
23. Hailong Liu, Liang Sun
    The bondage and connectivity of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:289-293 [Journal]
    
24. Sonoko Moriyama, Fumihiko Takeuchi
    Incremental construction properties in dimension two--shellability, extendable shellability and vertex decomposability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:295-296 [Journal]
    
25. Dieter Rautenbach, Lutz Volkmann
    Extremal subgraphs with respect to vertex degree bounds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:297-303 [Journal]
    
26. Iwao Sato
    Decomposition formulas of zeta functions of graphs and digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:305-309 [Journal]
    
27. Friedrich Wehrung
    Direct decompositions of non-algebraic complete lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:311-321 [Journal]
    
28. Jinjiang Yuan, Qin Wang
    Partition the vertices of a graph into induced matchings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:323-329 [Journal]
    
29. Yue Zhao
    On the edge-reconstruction of graphs embedded in surfaces IV. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:331-338 [Journal]
    
30. Guofei Zhou
    A note on graphs of class I. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:263, n:1-3, pp:339-345 [Journal]