Journals in DBLP

Discrete Mathematics
1999, volume: 199, number: 1-3

1. Ruth A. Britto-Pacumio
   Limits of iteratd H-line graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:1-10 [Journal]
   
2. Gerard J. Chang, Bhaskar DasGupta, Wayne M. Dymàcek, Martin Fürer, Matthew Koerlin, Yueh-Shin Lee, Tom Whaley
   Characterizations of bipartite Steinhaus graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:11-25 [Journal]
   
3. Michele Conforti, Gérard Cornuéjols, Kristina Vuskovic
   Balanced cycles and holes in bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:27-33 [Journal]
   
4. Jean E. Dunbar, Stephen T. Hedetniemi, Michael A. Henning, Alice A. McRae
   Minus domination in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:35-47 [Journal]
   
5. Harald Fripertinger
   Enumeration of mosaics. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:49-60 [Journal]
   
6. Wayne Goddard, Michael A. Henning
   Real and integer domination in graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:61-75 [Journal]
   
7. David J. Grabiner
   Posets in which every interval is a product of chains, and natural local actions of the symmetric group. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:77-84 [Journal]
   
8. Michael D. Hirschhorn, James A. Sellers
   On representations of a number as a sum of three squares. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:85-101 [Journal]
   
9. Jacques Mazoyer, Ivan Rapaport
   Global fixed point attractors of circular cellular automata and periodic tilings of the plane: Undecidability results. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:199, n:1-3, pp:103-122 [Journal]
   
10. Colin McDiarmid, Bruce A. Reed
    Colouring proximity graphs in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:123-137 [Journal]
    
11. Michel Minoux
    A generalization of the all minors tree theorem to semirings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:139-150 [Journal]
    
12. J. Schmid
    On maximal sublattices of finite lattices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:151-159 [Journal]
    
13. Andreas E. Schroth
    How to draw a hexagon. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:161-171 [Journal]
    
14. Piotr Wójcik
    Union-closed families of sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:173-182 [Journal]
    
15. Wenan Zang
    Acyclic diagraphs with the Gallai-Milgram-Linial property for clique-covers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:183-192 [Journal]
    
16. Rita Csákány, János Komlós
    The smallest Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:193-199 [Journal]
    
17. Bostjan Bresar
    On clique-gated graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:201-205 [Journal]
    
18. Mike Daven, C. A. Rodger
    (k, g)-cages are 3-connected. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:207-215 [Journal]
    
19. Andrej Dujella
    A bijective proof of Riordan's theorem on powers of Fibonacci numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:217-220 [Journal]
    
20. Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning
    On perfect neighborhood sets in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:221-225 [Journal]
    
21. Gary Haggard, Thomas R. Mathies
    The computation of chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:227-231 [Journal]
    
22. Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
    A characterization of uniquely vertex colorable graphs using minimal defining sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:233-236 [Journal]
    
23. Ren Han
    Another cycle structure theorem for hamiltonian graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:237-243 [Journal]
    
24. Andreas Huck
    Independent branchings in acyclic diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:245-249 [Journal]
    
25. Alexander K. Kelmans, Xuerong Yong
    On the distribution of eigenvalues of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:251-258 [Journal]
    
26. Péter Komjáth
    Some remarks on universal graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:259-265 [Journal]
    
27. Miroslav Treml
    Some partitions of positive integers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:267-271 [Journal]
    
28. Kazuhiko Ushio
    Cycle-factorization of symmetric complete multipartite digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:273-278 [Journal]
    
29. Baogen Xu, Zhongfu Zhang
    On mixed Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:285-289 [Journal]
    
30. Sanming Zhou
    A sequential coloring algorithm for finite sets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:199, n:1-3, pp:291-297 [Journal]