Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 33
Volume 33, Number 3, December 1982
- Cornelis Roos, A. J. van Zanten:
On the existence of certain distance-regular graphs. 197-212
- Aeryung Moon:
Characterization of the graphs of the Johnson schemes G(3k, k) and G(3k + 1, k). 213-221 - David W. Barnette:
Generating the triangulations of the projective plane. 222-230 - Frank Thomson Leighton:
Finite common coverings of graphs. 231-238 - Paul H. Edelman
:
The lattice of convex sets of an oriented matroid. 239-244 - Tian Feng, Zheng-Sheng Wu, Cun-Quan Zhang:
Cycles of each length in tournaments. 245-255 - Aeryung Moon:
On the uniqueness of the graphs G(n, k) of the Johnson schemes. 256-264 - Victor Neumann-Lara:
The dichromatic number of a digraph. 265-270 - Bill Sands, Norbert Sauer, Robert E. Woodrow:
On monochromatic paths in edge-coloured digraphs. 271-275 - Philip J. Hanlon, Robert W. Robinson:
Counting bridgeless graphs. 276-305
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2023-06-05 01:08 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
