The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2007, volume: 307, number: 23


  1. Counting strings in Dyck paths. [Citation Graph (, )][DBLP]


  2. Cycle-magic graphs. [Citation Graph (, )][DBLP]


  3. Edge-dominating cycles in graphs. [Citation Graph (, )][DBLP]


  4. Canonical equivalence relations on nets of PSc0. [Citation Graph (, )][DBLP]


  5. Counting labeled general cubic graphs. [Citation Graph (, )][DBLP]


  6. The structure of K3, 3-subdivision-free toroidal graphs. [Citation Graph (, )][DBLP]


  7. 3-Factor-criticality in domination critical graphs. [Citation Graph (, )][DBLP]


  8. Value and position of large weak left-to-right maxima for samples of geometrically distributed variables. [Citation Graph (, )][DBLP]


  9. The period and base of a reducible sign pattern matrix. [Citation Graph (, )][DBLP]


  10. Choosability of graphs with infinite sets of forbidden differences. [Citation Graph (, )][DBLP]


  11. Perfect matchings after vertex deletions. [Citation Graph (, )][DBLP]


  12. The Erdös-Sós conjecture for spiders. [Citation Graph (, )][DBLP]


  13. Improved bounds on acyclic edge colouring. [Citation Graph (, )][DBLP]


  14. p-adic valuations and k-regular sequences. [Citation Graph (, )][DBLP]


  15. An inequality for the group chromatic number of a graph. [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