The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1985, volume: 55, number: 2

  1. Martin Charles Golumbic
    Interval graphs and related topics. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:113-121 [Journal]
  2. Claude Benzaken, Peter L. Hammer, Dominique de Werra
    Split graphs of Dilworth number 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:123-127 [Journal]
  3. Paul Erdös, Douglas B. West
    A note on the interval number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:129-133 [Journal]
  4. Peter C. Fishburn
    Interval graphs and interval orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:135-149 [Journal]
  5. Martin Charles Golumbic, Robert E. Jamison
    Edge and vertex intersection of paths in a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:151-159 [Journal]
  6. András Gyárfás
    On the chromatic number of multiple interval graphs and overlap graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:161-166 [Journal]
  7. András Gyárfás, Jenö Lehel
    Covering and coloring problems for relatives of intervals. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:167-180 [Journal]
  8. Lefteris M. Kirousis, Christos H. Papadimitriou
    Interval graphs and seatching. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:181-184 [Journal]
  9. Edward R. Scheinerman
    Characterizing intersection classes of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:185-193 [Journal]
  10. Edward R. Scheinerman
    Irrepresentability by multiple intersection, or why the interval number is unbounded. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:195-211 [Journal]
  11. Dale Skrien, John Gimbel
    Homogeneously representable interval graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:213-216 [Journal]
  12. Maciej M. Syslo
    Triangulated edge intersection graphs of paths in a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:217-220 [Journal]
  13. Robert Endre Tarjan
    Decomposition by clique separators. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:221-232 [Journal]
  14. Austin Teng, Alan Tucker
    An O(qn) algorithm to q-color a proper family of circular arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:55, n:2, pp:233-243 [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