Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 6

1. Camino Balbuena, Martín Cera, Ana Diánez, Pedro García-Vázquez, Xavier Marcote
   On the restricted connectivity and superconnectivity in graphs with given girth. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:659-667 [Journal]
   
2. Jason Bell, Mark Skandera
   Multicomplexes and polynomials with real zeros. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:668-682 [Journal]
   
3. Tamara Burton, David P. Sumner
   gamma-Excellent, critically dominated, end-dominated, and dot-critical trees are equivalent. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:683-693 [Journal]
   
4. Yair Caro, Dieter Rautenbach
   Reconstructing graphs from size and degree properties of their induced k-subgraphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:694-703 [Journal]
   
5. Maria Rita Casali
   Estimating Matveev's complexity via crystallization theory. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:704-714 [Journal]
   
6. H. Michael Damm
   Totally anti-symmetric quasigroups for all orders n =/ 2, 6. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:715-729 [Journal]
   
7. Mirko Lepovic
   On conjugate adjacency matrices of a graph. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:730-738 [Journal]
   
8. Stefano Marcugini, Alfredo Milani, Fernanda Pambianco
   Complete arcs in PG(2, 25): The spectrum of the sizes and the classification of the smallest complete arcs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:739-747 [Journal]
   
9. Camino Balbuena, Pedro García-Vázquez, Xavier Marcote, Juan Carlos Valenzuela
   Counterexample to a conjecture of Györi on C_2l-free bipartite graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2007, v:307, n:6, pp:748-749 [Journal]
   
10. Dragic Bankovic
    Boolean inequations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:750-755 [Journal]
    
11. Frank Gurski, Egon Wanke
    A local characterization of bounded clique-width for line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:756-759 [Journal]
    
12. Yi Ru Huang, Yuandi Wang, Wancheng Sheng, Jian Sheng Yang, Kemin Zhang, Jian Huang
    New upper bound formulas with parameters for Ramsey numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:760-763 [Journal]
    
13. Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
    The Erdos-Pósa property for vertex- and edge-disjoint odd cycles in graphs on orientable surfaces. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:764-768 [Journal]
    
14. Michel Morvan, Eric Rémila, Eric Thierry
    A note on the structure of spaces of domino tilings. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:769-773 [Journal]
    
15. Vladimir Nikiforov
    Eigenvalue problems of Nordhaus-Gaddum type. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:774-780 [Journal]
    
16. Ioan Tomescu
    On the chromaticity of sunflower hypergraphs SH(n, p, h). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2007, v:307, n:6, pp:781-786 [Journal]