default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 226
Volume 226, Number 1-3, January 2001
- R. Julian R. Abel, Malcolm Greig, Ying Miao, Lie Zhu:
Resolvable BIBDs with block size 7 and index 6. 1-20 - Geir Agnarsson
, Benjamin Doerr, Tomasz Schoen:
Coloring t-dimensional m-Boxes. 21-33 - Kenneth P. Bogart, Michael S. Jacobson, Larry J. Langley, Fred R. McMorris:
Tolerance orders and bipartite unit tolerance graphs. 35-50 - Iliya Bouyukliev, David B. Jaffe:
Optimal binary linear codes of dimension at most seven. 51-70 - Grant Cairns, Deborah M. King:
All odd musquashes are standard. 71-91 - Gary Chartrand, Donald W. VanderJagt, Ping Zhang:
On the planarity of iterated jump graphs. 93-106 - Marc Chastand:
Fiber-complemented graphs -- I: structure and invariant subgraphs. 107-141 - Michele Conforti, Romeo Rizzi:
Shortest paths in conservative graphs. 143-153 - Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs: The limit case of a spectral property. 155-173 - David Forge, Jorge L. Ramírez Alfonsín:
On reconstructing arrangements from their sets of simplices. 175-190 - Hung-Lin Fu, Ming-Chun Tsai, N. H. Xuong:
The decay number and the maximum genus of diameter 2 graphs. 191-197 - Satoru Fujishige, Sachin B. Patkar:
Realization of set functions as cut functions of graphs and hypergraphs. 199-210 - Lisa Hellerstein:
On generalized constraints and certificates. 211-232 - Zsolt Katona:
Intersecting families of sets, no l containing two common elements. 233-241 - Jeffrey H. Kingston, Nicholas Paul Sheppard:
On the hardness of computing maximum self-reduction sequences. 243-253 - Arnold Knopfmacher, Helmut Prodinger:
Combinatorics of geometrically distributed random variables: Value and position of the rth left-to-right maximum. 255-267 - Mirka Miller, Jozef Sirán:
Digraphs of degree two which miss the Moore bound by two. 269-280 - Henning S. Mortveit, Christian M. Reidys:
Discrete, sequential dynamical systems. 281-295 - Dieter Rautenbach, Vadim E. Zverovich:
Perfect graphs of strong domination and independent strong domination. 297-311 - Jonathan Tuliani:
De Bruijn sequences with efficient decoding algorithms. 313-336 - Ping-Hong Wei, Chih-Wen Weng:
A typical vertex of a tree. 337-345 - Dietrich Morgenstern:
Proof of a conjecture by Walter Deuber concerning the distances between points of two types in Rd. 347-349 - Riste Skrekovski:
Two relations for median graphs. 351-353 - Ron M. Adin, Alexander Postnikov, Yuval Roichman:
On characters of Weyl groups. 355-358 - Vladimir E. Alekseev, Vadim V. Lozin:
On orthogonal representations of graphs. 359-363 - Robert A. Beezer, John E. Riegsecker, Bryan A. Smith:
Using minimum degree to bound average distance. 365-371 - Richard A. Brualdi, Jian Shen:
Diameter of the NEPS of bipartite graphs. 373-376 - J. M. Chao, Hitoshi Kaneta:
Classical arcs in PG(r, q) for 23 leq q leq 29. 377-385 - Ottavio M. D'Antona, Carlo Mereghetti, Fabio Zamparini:
The 224 non-chordal graphs on less than 10 vertices whose chromatic polynomials have no complex roots. 387-396 - Hung-Lin Fu, Wei-Hsin Hu:
A note on ascending subgraph decompositions of complete multipartite graphs. 397-402 - Tor Helleseth, Chunming Rong, Kyeongcheol Yang:
New 3-designs from Goethals codes over Z4. 403-409 - Yehuda Roditty, Barack Shoham, Raphael Yuster:
Monotone paths in edge-ordered sparse graphs. 411-417 - Ling-sheng Shi, Kemin Zhang:
A bound for multicolor Ramsey numbers. 419-421 - George G. Szpiro:
The number of permutations with a given signature, and the expectations of their elements. 423-430 - Stephen S. Wang:
Pebbling and Graham's Conjecture. 431-438 - Wen-Jin Woan:
Area of Catalan paths. 439-444 - Boris Zgrablic:
On quasiabelian Cayley graphs. 445-447
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 2025-12-15 22:37 CET 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:
