The SCEAS System
Navigation Menu

Journals in DBLP

Discrete Mathematics
1982, volume: 41, number: 1

  1. Douglas Bauer, Ralph Tindell
    Graphs isomorphic to subgraphs of their line-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:1-6 [Journal]
  2. I. Debroey, Frank De Clerck
    Non-trivial GammaDelta-regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:7-15 [Journal]
  3. Ryoh Fuji-Hara, Scott A. Vanstone
    Orthogonal resolutions of lines in AG(n, q). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:17-28 [Journal]
  4. Roland Häggkvist, Carsten Thomassen
    Circuits through specified edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:29-34 [Journal]
  5. J. D. Horton
    On two-factors of bipartite regular graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:35-41 [Journal]
  6. Vikram Jha
    On subgroups and factor groups of GL(n, q) acting on spreads with the same characteristic. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:43-51 [Journal]
  7. Oscar Moreno
    On primitive elements of trace equal to 1 in GF(2m). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:53-56 [Journal]
  8. Yossi Shiloach, Uzi Vishkin, Shmuel Zaks
    Golden ratios in a pairs covering problem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:57-65 [Journal]
  9. Andrew Thomason
    Critically partitionable graphs II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:67-77 [Journal]
  10. Cun-Quan Zhang
    Arc-disjoint circuits in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:79-96 [Journal]
  11. David A. Gregory, Norman J. Pullman
    On a clique covering problem of orlin. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:97-99 [Journal]
  12. M. R. Sridharan, O. T. George
    On the strong perfect graph conjecture and critical graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:101-104 [Journal]
  13. Hortensia Galeana-Sánchez
    A counterexample to a conjecture of meyniel on kernel-perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:105-107 [Journal]
  14. Patricia Vanden Cruyce
    A characterization of the n-cube by convex subgraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1982, v:41, n:1, pp:109-110 [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