The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2008, volume: 308, number: 19


  1. Guest Editors' Foreword. [Citation Graph (, )][DBLP]


  2. The pebbling threshold of the square of cliques. [Citation Graph (, )][DBLP]


  3. Long alternating paths in bicolored point sets. [Citation Graph (, )][DBLP]


  4. On embedding well-separable graphs. [Citation Graph (, )][DBLP]


  5. Pentagons vs. triangles. [Citation Graph (, )][DBLP]


  6. Quadripartite version of the Hajnal-Szemerédi theorem. [Citation Graph (, )][DBLP]


  7. The Cameron-Erdös conjecture. [Citation Graph (, )][DBLP]


  8. Disjoint unions of complete minors. [Citation Graph (, )][DBLP]


  9. Growing perfect cubes. [Citation Graph (, )][DBLP]


  10. Planar Ramsey numbers for cycles. [Citation Graph (, )][DBLP]


  11. Unavoidable subgraphs of colored graphs. [Citation Graph (, )][DBLP]


  12. On covering vertices of a graph by trees. [Citation Graph (, )][DBLP]


  13. Thue type problems for graphs, points, and numbers. [Citation Graph (, )][DBLP]


  14. Constructions of non-principal families in extremal hypergraph theory. [Citation Graph (, )][DBLP]


  15. On Ks, t-minors in graphs with given average degree. [Citation Graph (, )][DBLP]


  16. Density of constant radius normal binary covering codes. [Citation Graph (, )][DBLP]


  17. Problems and results in extremal combinatorics - II. [Citation Graph (, )][DBLP]


  18. Nonrepetitive colorings of graphs of bounded tree-width. [Citation Graph (, )][DBLP]


  19. Subdivisions of graphs: A generalization of paths and cycles. [Citation Graph (, )][DBLP]


  20. Connected graphs without long paths. [Citation Graph (, )][DBLP]


  21. Covering the n-space by convex bodies and its chromatic number. [Citation Graph (, )][DBLP]


  22. Note on the 3-graph counting lemma. [Citation Graph (, )][DBLP]


  23. Long paths with endpoints in given vertex-subsets of graphs. [Citation Graph (, )][DBLP]

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002