Journals in DBLP

Discrete Mathematics
1986, volume: 58, number: 1

1. Denise Amar
   Partition of a bipartite hamiltonian graph into two cycles. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:1-10 [Journal]
   
2. Didier Arquès
   Les hypercartes planaires sont des arbres tres bien etiquetes. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:11-24 [Journal]
   
3. Michael Hager
   On score sets for tournaments. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:25-34 [Journal]
   
4. Antonín Leanovsky, Vlastimil Pták
   A measure of thickness for families of sets. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:35-44 [Journal]
   
5. Antonio Pasini
   On certain geometries of type C_n and F₄. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:45-61 [Journal]
   
6. Anthony J. W. Hilton, Christopher A. Rodger
   Hamiltonian decompositions of complete regular s-partite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:63-78 [Journal]
   
7. Bojan Mohar
   On the cycle space of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:79-80 [Journal]
   
8. Ulrich Betke, Peter Gritzmann
   An application of valuation theory to two problems in discrete geometry. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:81-85 [Journal]
   
9. C. R. J. Clapham
   Universal tilings and universal (0, 1)-matrices. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1986, v:58, n:1, pp:87-92 [Journal]
   
10. Yoshimi Egawa, Masatsugu Urabe, Toshihito Fukuda, Seiichiro Nagoya
    A decomposition of complete bipartite graphs into edge-disjoint subgraphs with star components. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:93-95 [Journal]
    
11. Nathan Linial
    Graph coloring and monotone functions on posets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:97-98 [Journal]
    
12. Svatopluk Poljak, Daniel Turzík
    A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:99-104 [Journal]
    
13. Dominique Sotteau, A. Pawel Wojda
    Digraphs without directed path of length two or three. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:105-108 [Journal]
    
14. M. Werman, Doron Zeilberger
    A bijective proof of Cassini's Fibonacci identity. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:1, pp:109- [Journal]