Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 218
Volume 218, Number 1-3, May 2000
- Douglas Bauer, Linda E. McGuire, Huib Trommel, Henk Jan Veldman:
Long cycles in 3-cyclable graphs. 1-8 - Yanxun Chang:
The existence of resolvable BIBD with k even and lambda=1. 9-23 - Rossella Di Monte, Osvaldo Ferri, Stefania Ferri:
Characterization of quadric cones in a Galois projective space. 25-31 - Cunsheng Ding, Tor Helleseth, Kwok-Yan Lam:
Duadic sequences of prime lengths. 33-49 - Pavel G. Emelyanov
, Agung Lukito:
On the maximal length of a snake in hypercubes of small dimension. 51-59 - Hortensia Galeana-Sánchez:
Semikernels modulo F and kernels in digraphs. 61-71 - Oliver Goodman, Vincent Moulton:
On the tight span of an antipodal graph. 73-96 - Michael I. Hartley:
Polytopes of finite type. 97-108 - Daniel A. Klain:
Free polygon enumeration and the area of an integral polygon. 109-119 - Darla Kremer:
Permutations with forbidden subsequences and a generalized Schro"der number. 121-130 - Manoel Lemos, James G. Oxley:
On the 3-connected matroids that are minimal having a fixed spanning restriction. 131-165 - Donatella Merlini, M. Cecilia Verri:
Generating trees and proper Riordan Arrays. 167-183 - Irena Rusu:
Even pairs in Artemis graphs. 185-197 - Yukio Shibata, Toru Hasunuma, Sanae Fukuda:
Isomorphic factorization of de Bruijn digraphs. 199-208 - Alexander Stoimenow:
On the number of chord diagrams. 209-233 - Olivier Togni:
Irregularity strength and compound graphs. 235-243 - Igor E. Zverovich:
Multi-intersection graphs. 245-251 - Malgorzata Zwonek:
Pseudototal colourings of digraphs. 253-263 - Mirka Miller, Joan Gimbert, Jozef Sirán, Slamin:
Almost Moore digraphs are diregular. 265-270 - James G. Oxley, Geoffrey P. Whittle:
On the non-uniqueness of q-cones of matroids. 271-275 - Mateja Sajna:
On the problem of a matching orthogonal to a 2-factorization. 277-282 - G. Sethuraman, R. Dhavamani:
Graceful numbering of an edge-gluing of shell graphs. 283-287 - Eckhard Steffen:
A refinement of Vizing's theorem. 289-291 - Xudong Yuan, Mao-cheng Cai:
Vertices of degree k in a minimally k-edge-connected digraph. 293-298
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 2024-04-22 21:03 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:
