The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Applied Mathematics
1992, volume: 36, number: 1


  1. New clique and independent set algorithms for circle graphs. [Citation Graph (, )][DBLP]


  2. An optimal algorithm for finding dominating cycles in circular-arc graphs. [Citation Graph (, )][DBLP]


  3. Some results concerning the complexity of restricted colorings of graphs. [Citation Graph (, )][DBLP]


  4. Stability number and chromatic number of tolerance graphs. [Citation Graph (, )][DBLP]


  5. Generating permutations with given ups and downs. [Citation Graph (, )][DBLP]


  6. Generalized hexagonal systems with each hexagon being resonant. [Citation Graph (, )][DBLP]


  7. Edge colouring line graphs of unicyclic graphs. [Citation Graph (, )][DBLP]


  8. A binary search problem on graphs. [Citation Graph (, )][DBLP]


  9. Narrowness, pathwidth, and their application in natural language processing. [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