The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2009, volume: 309, number: 13


  1. On spanning tree congestion of graphs. [Citation Graph (, )][DBLP]


  2. Translation groups of Steiner loops. [Citation Graph (, )][DBLP]


  3. Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. [Citation Graph (, )][DBLP]


  4. A note on Berge-Fulkerson coloring. [Citation Graph (, )][DBLP]


  5. On the Laplacian spectral radii of trees. [Citation Graph (, )][DBLP]


  6. Canonical Ramsey numbers and properly colored cycles. [Citation Graph (, )][DBLP]


  7. Error-correcting codes from permutation groups. [Citation Graph (, )][DBLP]


  8. A degree sum condition for graphs to be prism hamiltonian. [Citation Graph (, )][DBLP]


  9. Minimal 2-matching-covered graphs. [Citation Graph (, )][DBLP]


  10. Independent arcs of acyclic orientations of complete r-partite graphs. [Citation Graph (, )][DBLP]


  11. Canonical and monophonic convexities in hypergraphs. [Citation Graph (, )][DBLP]


  12. On colorings of graph powers. [Citation Graph (, )][DBLP]


  13. Blockers and transversals. [Citation Graph (, )][DBLP]


  14. The ordering of unicyclic graphs with the smallest algebraic connectivity. [Citation Graph (, )][DBLP]


  15. Complete r-partite subgraphs of dense r-graphs. [Citation Graph (, )][DBLP]


  16. Nash equilibria in all-optical networks. [Citation Graph (, )][DBLP]


  17. Cayley digraphs with normal adjacency matrices. [Citation Graph (, )][DBLP]


  18. Color degree and alternating cycles in edge-colored graphs. [Citation Graph (, )][DBLP]


  19. Vertex domination of generalized Petersen graphs. [Citation Graph (, )][DBLP]


  20. Netlike partial cubes, V: Completion and netlike classes. [Citation Graph (, )][DBLP]


  21. Relations on generalized degree sequences. [Citation Graph (, )][DBLP]


  22. Interleaving schemes on circulant graphs with two offsets. [Citation Graph (, )][DBLP]


  23. On b-coloring of the Kneser graphs. [Citation Graph (, )][DBLP]


  24. The maximum Randic index of chemical trees with k pendants. [Citation Graph (, )][DBLP]


  25. Super-stationary set, subword problem and the complexity. [Citation Graph (, )][DBLP]


  26. Incongruent restricted disjoint covering systems. [Citation Graph (, )][DBLP]


  27. Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five. [Citation Graph (, )][DBLP]


  28. On a graph's security number. [Citation Graph (, )][DBLP]


  29. Edges of degree k in minimally restricted k-edge connected graphs. [Citation Graph (, )][DBLP]


  30. Minimal and locally minimal games and game forms. [Citation Graph (, )][DBLP]


  31. Trees with the second largest number of maximal independent sets. [Citation Graph (, )][DBLP]


  32. Constructing continuum many countable, primitive, unbalanced digraphs. [Citation Graph (, )][DBLP]


  33. Partitions of a set satisfying certain set of conditions. [Citation Graph (, )][DBLP]


  34. Maximal Sidon sets and matroids. [Citation Graph (, )][DBLP]


  35. Circular game chromatic number of graphs. [Citation Graph (, )][DBLP]


  36. Primitive normal polynomials with the specified last two coefficients. [Citation Graph (, )][DBLP]


  37. Game colouring of the square of graphs. [Citation Graph (, )][DBLP]


  38. On a conjecture of V. Nikiforov. [Citation Graph (, )][DBLP]


  39. The evolution of the min-min random graph process. [Citation Graph (, )][DBLP]


  40. Regular Steinhaus graphs of odd degree. [Citation Graph (, )][DBLP]


  41. On cyclic edge-connectivity of transitive graphs. [Citation Graph (, )][DBLP]


  42. Maximal integral point sets in affine planes over finite fields. [Citation Graph (, )][DBLP]


  43. Counting polycubes without the dimensionality curse. [Citation Graph (, )][DBLP]


  44. On Beck's coloring of posets. [Citation Graph (, )][DBLP]


  45. Stability of the path-path Ramsey number. [Citation Graph (, )][DBLP]


  46. On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. [Citation Graph (, )][DBLP]


  47. On graphs whose square have strong hamiltonian properties. [Citation Graph (, )][DBLP]


  48. Generalization of transitive fraternal augmentations for directed graphs and its applications. [Citation Graph (, )][DBLP]


  49. Bounds on the location of the maximum Stirling numbers of the second kind. [Citation Graph (, )][DBLP]


  50. Packing and covering k-chain free subsets in Boolean lattices. [Citation Graph (, )][DBLP]


  51. On the minimum real roots of the adjoint polynomial of a graph. [Citation Graph (, )][DBLP]


  52. Degree sum conditions for oriented forests in digraphs. [Citation Graph (, )][DBLP]


  53. A note on acyclic edge coloring of complete bipartite graphs. [Citation Graph (, )][DBLP]


  54. The k-restricted edge connectivity of undirected Kautz graphs. [Citation Graph (, )][DBLP]


  55. On spanning tree congestion. [Citation Graph (, )][DBLP]


  56. Tree-length equals branch-length. [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