default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 219
Volume 219, Number 1-3, May 2000
- Béla Bollobás, Oliver Riordan:
Polychromatic polynomials. 1-7 - Mieczyslaw Borowiecki, Mariusz Haluszczak, Miroslawa Skowronska:
Minimal reducible bounds for 1-nonouterplanar graphs. 9-15 - Guantao Chen, Michael S. Jacobson, André E. Kézdy
, Jenö Lehel, Edward R. Scheinerman, Chi Wang:
Clique covering the edges of a locally cobipartite graph. 17-26 - Bruce N. Cooperstein:
A combinatorial construction of a graph with automorphism group SO+(2n, 2). 27-35 - B. Corbas, Graham D. Williams:
Congruence classes in M3(Fq) (q odd). 37-47 - Steven T. Dougherty, Masaaki Harada, Patrick Solé:
Shadow lattices and shadow codes. 49-64 - Ioana Dumitriu:
On generalized Tribonacci sequences and additive partitions. 65-83 - Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann:
Bipartite Ramsey numbers and Zarankiewicz numbers. 85-95 - Wolfgang Haas:
Lower bounds for q-ary codes of covering radius one. 97-106 - Günter Heinz:
Lower and upper bounds on the total weight of semi-rich acyclic arrangements of oriented lines in the plane. 107-122 - Robert Johansson:
On the bipartite case of El-Zahárs conjecture. 123-134 - Liying Kang, Mao-cheng Cai:
Upper minus domination in regular graphs. 135-144 - Hal A. Kierstead:
Extending partial colorings of graphs. 145-152 - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of G vertex-multiplications. 153-171 - Clement W. H. Lam, Ying Miao:
Cyclically resolvable cyclic Steiner triple systems of order 21 and 39. 173-185 - Max Landsberg:
Feedback functions for generating cycles over a finite alphabet. 187-194 - Rao Li:
A Fan-type condition for claw-free graphs to be Hamiltonian. 195-205 - Alan C. H. Ling, Charles J. Colbourn:
Modified group divisible designs with block size four. 207-221 - Hua Peng, Catherine Huafei Yan:
On the discrepancy of strongly unimodular matrices. 223-233 - Takao Ueda:
Gray codes for necklaces. 235-248 - Xiaomin Bao:
On the blocking sets in S(3, 6, 22) and S(4, 7, 23). 249-252 - Mao-cheng Cai, Xiaotie Deng, Wenan Zang:
Solution to a problem on degree sequences of graphs. 253-257 - Rajendra S. Deodhar, Murali K. Srinivasan:
Explicit semisymmetric chain decomposition of the partition lattice. 259-264 - Laura L. Dolph, Annmarie Reynolds, James A. Sellers:
Congruences for a restricted m-ary partition function. 265-269 - Keith J. Edwards:
Achromatic number versus pseudoachromatic number: a counterexample to a conjecture of Hedetniemi. 271-274 - John Gimbel, Carsten Thomassen:
Coloring triangle-free graphs with fixed size. 275-277 - Solomon W. Golomb, Guang Gong, Zong-Duo Dai:
Cyclic inequivalence of cascaded GMW-sequences. 279-285 - Sandi Klavzar, Riste Skrekovski:
On median graphs and median grid graphs. 287-293 - Frank Göring:
Short proof of Menger's Theorem. 295-296
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-08 09:52 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:
