The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2009, volume: 309, number: 22


  1. Preface. [Citation Graph (, )][DBLP]


  2. On-line arbitrarily vertex decomposable suns. [Citation Graph (, )][DBLP]


  3. Hamiltonicity and pancyclicity of cartesian products of graphs. [Citation Graph (, )][DBLP]


  4. A new type of edge-derived vertex coloring. [Citation Graph (, )][DBLP]


  5. On double bound graphs and forbidden subposets. [Citation Graph (, )][DBLP]


  6. Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. [Citation Graph (, )][DBLP]


  7. Edge decompositions into two kinds of graphs. [Citation Graph (, )][DBLP]


  8. Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. [Citation Graph (, )][DBLP]


  9. Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. [Citation Graph (, )][DBLP]


  10. Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. [Citation Graph (, )][DBLP]


  11. Isometric embeddings of subdivided connected graphs into hypercubes. [Citation Graph (, )][DBLP]


  12. Antibandwidth of complete k-ary trees. [Citation Graph (, )][DBLP]


  13. On detour homogeneous digraphs. [Citation Graph (, )][DBLP]


  14. On isomorphic linear partitions in cubic graphs. [Citation Graph (, )][DBLP]


  15. Product irregularity strength of graphs. [Citation Graph (, )][DBLP]


  16. Graph designs for the eight-edge five-vertex graphs. [Citation Graph (, )][DBLP]


  17. Size Ramsey numbers for some regular 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