Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 12

1. 
   Neighborhood unions and extremal spanning trees. [Citation Graph (, )][DBLP]
   
   
2. 
   Line-graphs of cubic graphs are normal. [Citation Graph (, )][DBLP]
   
   
3. 
   Generalized Latin squares and their defining sets. [Citation Graph (, )][DBLP]
   
   
4. 
   A note on shellability and acyclic orientations. [Citation Graph (, )][DBLP]
   
   
5. 
   A degree sum condition for long cycles passing through a linear forest. [Citation Graph (, )][DBLP]
   
   
6. 
   A lower bound for the vertex boundary-width of complete k-ary trees. [Citation Graph (, )][DBLP]
   
   
7. 
   Planarization and fragmentability of some classes of graphs. [Citation Graph (, )][DBLP]
   
   
8. 
   Compact cyclic edge-colorings of graphs. [Citation Graph (, )][DBLP]
   
   
9. 
   On low degree k-ordered graphs. [Citation Graph (, )][DBLP]
   
   
10. 
    Forcing faces in plane bipartite graphs. [Citation Graph (, )][DBLP]
    
    
11. 
    Cyclic hamiltonian cycle systems of the complete graph minus a 1-factor. [Citation Graph (, )][DBLP]
    
    
12. 
    Bell polynomials and binomial type sequences. [Citation Graph (, )][DBLP]
    
    
13. 
    Independent sets and non-augmentable paths in generalizations of tournaments. [Citation Graph (, )][DBLP]
    
    
14. 
    Distance paired domination numbers of graphs. [Citation Graph (, )][DBLP]
    
    
15. 
    On the order of ({r, m};g)-cages of even girth. [Citation Graph (, )][DBLP]
    
    
16. 
    Pairing conjugate partitions by residue classes. [Citation Graph (, )][DBLP]
    
    
17. 
    More orthogonal double covers of complete graphs by Hamiltonian paths. [Citation Graph (, )][DBLP]
    
    
18. 
    Descents, inversions, and major indices in permutation groups. [Citation Graph (, )][DBLP]
    
    
19. 
    Locally strong endomorphisms of paths. [Citation Graph (, )][DBLP]
    
    
20. 
    On extremal k-outconnected graphs. [Citation Graph (, )][DBLP]
    
    
21. 
    Enumeration via ballot numbers. [Citation Graph (, )][DBLP]
    
    
22. 
    On semicomplete multipartite digraphs whose king sets are semicomplete digraphs. [Citation Graph (, )][DBLP]
    
    
23. 
    5-Chromatic even triangulations on surfaces. [Citation Graph (, )][DBLP]
    
    
24. 
    Chordal bipartite completion of colored graphs. [Citation Graph (, )][DBLP]
    
    
25. 
    Tight bounds for eternal dominating sets in graphs. [Citation Graph (, )][DBLP]
    
    
26. 
    Edge degrees and dominating cycles. [Citation Graph (, )][DBLP]
    
    
27. 
    Weighted Bartholdi zeta functions of graph coverings. [Citation Graph (, )][DBLP]
    
    
28. 
    Connectivity of the Mycielskian of a graph. [Citation Graph (, )][DBLP]
    
    
29. 
    A combinatorial proof of the Lebesgue identity. [Citation Graph (, )][DBLP]
    
    
30. 
    Partitions of the set of natural numbers and their representation functions. [Citation Graph (, )][DBLP]
    
    
31. 
    The spectrum of 1-rotational Steiner triple systems over a dicyclic group. [Citation Graph (, )][DBLP]
    
    
32. 
    Size of monochromatic components in local edge colorings. [Citation Graph (, )][DBLP]
    
    
33. 
    A note on lattice chains and Delannoy numbers. [Citation Graph (, )][DBLP]
    
    
34. 
    The existence and uniqueness of strong kings in tournaments. [Citation Graph (, )][DBLP]
    
    
35. 
    Hamiltonian connected hourglass free line graphs. [Citation Graph (, )][DBLP]
    
    
36. 
    Lower bounds for the game colouring number of partial k-trees and planar graphs. [Citation Graph (, )][DBLP]
    
    
37. 
    Weakly s-arc transitive graphs. [Citation Graph (, )][DBLP]
    
    
38. 
    A note on degree-constrained subgraphs. [Citation Graph (, )][DBLP]
    
    
39. 
    A note on the edge cover number and independence number in hypergraphs. [Citation Graph (, )][DBLP]