The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
2006, volume: 306, number: 7

  1. Mekkia Kouider, Manouchehr Zaker
    Bounds for the b-chromatic number of some families of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:617-623 [Journal]
  2. Piotr Sniady
    Asymptotics of characters of symmetric groups, genus expansion and free probability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:624-665 [Journal]
  3. Thomas Böhme, Martin Knor, Ludovít Niepel
    Linkability in iterated line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:666-669 [Journal]
  4. Kefeng Diao, Guizhen Liu, Dieter Rautenbach, Ping Zhao
    A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:670-672 [Journal]
  5. Henry A. Kierstead
    Weak acyclic coloring and asymmetric coloring games. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:673-677 [Journal]
  6. Imre Leader, Klas Markström
    Uncountable families of vertex-transitive graphs of finite degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:678-679 [Journal]
  7. Manoel Lemos
    Matroids with few non-common bases. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:680-687 [Journal]
  8. Haruhide Matsuda
    Fan-type results for the existence of [a, b]-factors. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:688-693 [Journal]
  9. Øystein J. Rødseth
    Enumeration of M-partitions. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:694-698 [Journal]
  10. Khaled Salem, Sandi Klavzar, Ivan Gutman
    On the role of hypercubes in the resonance graphs of benzenoid graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:699-704 [Journal]
  11. Zhao Zhang, Jixiang Meng
    Semi-hyper-connected edge transitive graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:7, pp:705-710 [Journal]
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