The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2009, volume: 309, number: 5


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


  2. Removable matchings and hamiltonian cycles. [Citation Graph (, )][DBLP]


  3. Nowhere-zero 4-flow in almost Petersen-minor free graphs. [Citation Graph (, )][DBLP]


  4. Edge-connectivity and edge-disjoint spanning trees. [Citation Graph (, )][DBLP]


  5. Note on cycle double covers of graphs. [Citation Graph (, )][DBLP]


  6. Relaxed very asymmetric coloring games. [Citation Graph (, )][DBLP]


  7. Long cycles in 4-connected planar graphs. [Citation Graph (, )][DBLP]


  8. Size bipartite Ramsey numbers. [Citation Graph (, )][DBLP]


  9. Codiameters of 3-domination critical graphs with toughness more than one. [Citation Graph (, )][DBLP]


  10. Factor-critical property in 3-dominating-critical graphs. [Citation Graph (, )][DBLP]


  11. The Ramsey number R(C8, K8). [Citation Graph (, )][DBLP]


  12. Maximum bipartite subgraphs of cubic triangle-free planar graphs. [Citation Graph (, )][DBLP]


  13. On 2-factors with cycles containing specified edges in a bipartite graph. [Citation Graph (, )][DBLP]


  14. The edge version of Hadwiger's conjecture. [Citation Graph (, )][DBLP]


  15. On canonical antichains. [Citation Graph (, )][DBLP]


  16. Vertex pancyclicity in quasi-claw-free graphs. [Citation Graph (, )][DBLP]


  17. An upper bound on the domination number of n-vertex connected cubic graphs. [Citation Graph (, )][DBLP]


  18. (s, m)-radius of k-connected graphs. [Citation Graph (, )][DBLP]


  19. Pancyclic graphs and linear forests. [Citation Graph (, )][DBLP]


  20. The orientable genus of some joins of complete graphs with large edgeless 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