default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 274
Volume 274, Number 1-3, January 2004
- Mustapha Chellali, Lutz Volkmann:
Relations between the lower domination parameters and the chromatic number of a graph. 1-8 - Shaun Cooper, Michael D. Hirschhorn:
Results of Hurwitz type for three squares. 9-24 - Kai-Tai Fang, Xuan Lu, Yu Tang, Jianxing Yin:
Constructions of uniform designs by using resolvable packings and coverings. 25-40 - Paul Flondor, Ioana Leustean
:
MV-algebras with operators (the commutative and the non-commutative case). 41-76 - Malcolm Greig, Spencer P. Hurd, Dinesh G. Sarvate:
General constructions of c-Bhaskar Rao designs and the (c, lambda) spectrum of a c-BRD(v, k, lambda). 77-92 - James Haglund, Jeffrey B. Remmel:
Cycles and perfect matchings. 93-108 - Tor Helleseth, Victor A. Zinoviev:
On a new identity for Kloosterman sums and nonlinear system of equations over finite fields of characteristic 2. 109-124 - Michael A. Henning, Ortrud Oellermann:
On upper domination Ramsey numbers for graphs. 125-135 - Tao Jiang, Douglas B. West:
Edge-colorings of complete graphs that avoid polychromatic trees. 137-145 - Clark Kimberling:
Affinely recursive sets and orderings of languages. 147-159 - William Klostermeyer, Gary MacGillivray:
Homomorphisms and oriented colorings of equivalence classes of oriented graphs. 161-172 - Martin Kochol:
Tension-flow polynomials on graphs. 173-185 - Aleksander Malnic, Dragan Marusic, Changqun Wang:
Cubic edge-transitive graphs of order 2p3. 187-198 - Mariusz Meszka, Alexander Rosa:
Embedding Steiner triple systems into Steiner systems S(2, 4, v). 199-212 - Håvard Raddum:
On the computation of coset leaders with high Hamming weight. 213-231 - Radhika Ramamurthi, Douglas B. West:
Maximum face-constrained coloring of plane graphs. 233-240 - Boris A. Romov:
Completeness theory for the product of finite partial algebras. 241-264 - Joseph L. Yucas, Gary L. Mullen:
Irreducible polynomials over GF(2) with prescribed coefficients. 265-279 - Yuan Hong:
Tree-width, clique-minors, and eigenvalues. 281-287 - Andreas Klein:
On codes meeting the Griesmer bound. 289-297 - Dengxin Li, Deying Li, Jingzhong Mao:
On maximum number of edges in a spanning eulerian subgraph. 299-302 - Shougui Li:
On connected k-domination numbers of graphs. 303-310 - Yan Liu, Guizhen Liu:
Number of maximum matchings of bipartite graphs with positive surplus. 311-318 - Lon H. Mitchell:
Maximal total absolute displacement of a permutation. 319-321 - Nathan Reading:
Non-negative cd-coefficients of Gorensteinast posets. 323-329 - Jun Wang, Zhizheng Zhang:
On extensions of Calkin's binomial identities. 331-342
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-11-20 00:17 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:
