The SCEAS System
Navigation Menu

Journals in DBLP

Ars Comb.
2006, volume: 79, number:


  1. Near polygons having a big sub near polygon isomorphic to HD(2n-1, 4). [Citation Graph (, )][DBLP]


  2. The Weighted Integrity Problem is Polynomial for Interval Graphs. [Citation Graph (, )][DBLP]


  3. Distance Independent Domination In Iterated Line Graphs. [Citation Graph (, )][DBLP]


  4. Placing monitoring devices in electric power networks modelled by block graphs. [Citation Graph (, )][DBLP]


  5. A note on a conjecture of Gyarfas. [Citation Graph (, )][DBLP]


  6. Counting chains and antichains in the complete binary tree. [Citation Graph (, )][DBLP]


  7. C-Perfect K-Uniform Hypergraphs. [Citation Graph (, )][DBLP]


  8. Maximum genus, Girth and Maximum non-adjacent edge set. [Citation Graph (, )][DBLP]


  9. The Vertex Linear Arboricity of an Integer Distance Graph with a Special Distance Set. [Citation Graph (, )][DBLP]


  10. A Partial Kite System Of Oder n Can Be Embedded In A Kite System Of Order 8n+9. [Citation Graph (, )][DBLP]


  11. Characterizing Intersection Graphs of Substars of a Star. [Citation Graph (, )][DBLP]


  12. On the Supermagic Edge-splitting Extension of Graphs. [Citation Graph (, )][DBLP]


  13. On Some Conjectures by Rabinowitz. [Citation Graph (, )][DBLP]


  14. Note on Indices of Convergence of Digraphs. [Citation Graph (, )][DBLP]


  15. Further Ramsey Numbers for Small Complete Bipartite Graphs. [Citation Graph (, )][DBLP]


  16. The Basis Number of The Composition of Theta Graphs with Some Graphs. [Citation Graph (, )][DBLP]


  17. Orientable embedding distributions by genus for certain type of non-planar graphs (I). [Citation Graph (, )][DBLP]


  18. Disproof of a conjecture about average Steiner distance. [Citation Graph (, )][DBLP]


  19. On the Geodetic Covers and Geodetic Bases of the Composition G[Km]. [Citation Graph (, )][DBLP]


  20. Binary codes from graphs on triples and permutation decoding. [Citation Graph (, )][DBLP]


  21. The Graphs C(t)7 are Graceful for t = 0, 1, (mod 4). [Citation Graph (, )][DBLP]


  22. The Dynamic Coloring Numbers of Pseudo-Halin Graphs. [Citation Graph (, )][DBLP]


  23. Hyperhamiltonicity Of The Cartesian Product Of Two Directed Cycles. [Citation Graph (, )][DBLP]


  24. Distance between two k-sets and Path-Systems Extendibility. [Citation Graph (, )][DBLP]


  25. A Matrix Characterization of Near - MDS codes. [Citation Graph (, )][DBLP]


  26. On the signed total chromatic number of a graph. [Citation Graph (, )][DBLP]


  27. On a Prime Labeling Conjecture. [Citation Graph (, )][DBLP]


  28. On Some Generalizations of Fermat's, Lucas's and Wilson's Theorems. [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