Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics.
Among the fields covered by Discrete Mathematics are graph and hypergraph theory, network theory, enumeration, coding theory, block
designs, the theory of partially ordered sets, extremal set ... click here for full Aims & Scope
Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics.
Among the fields covered by Discrete Mathematics are graph and hypergraph theory, network theory, enumeration, coding theory, block
designs, the theory of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, polyhedra, combinatorial
and discrete geometry, matrices, and discrete probability theory.
Items in the journal may be research articles (Contributions or
Notes, depending on length), or survey/expository articles (Perspectives).
Occasional collections of unsolved problems are published;
submissions of such problems should be sent directly to the Editor-in-Chief for compilation. Efforts are made to process the submission
of Notes (short articles) quickly.
The Perspectives section features expository articles accessible to a broad audience that cast
new light or present unifying points of view on well-known or insufficiently-known topics.
Discrete Mathematics also publishes
occasional Special Issues, most of which are devoted to selected papers from a particular conference. Such issues are fully refereed
and adhere to the normal high standards of the journal.
Hide Aims & Scope
Home | Elsevier Sites | Privacy Policy | Terms and Conditions | Feedback | Site Map | A Reed Elsevier Company