default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 283
Volume 283, Number 1-3, June 2004
- Jørgen Bang-Jensen
:
The structure of strong arc-locally semicomplete digraphs. 1-6 - Gill Barequet:
The on-line Heilbronn's triangle problem. 7-14 - David R. Berman, Sandra C. McLaurin, Douglas D. Smith:
Ranking whist players. 15-28 - Bill Bogstad, Lenore Cowen:
The distinguishing number of the hypercube. 29-35 - Alewyn P. Burger, Jan H. van Vuuren:
Ramsey numbers in complete balanced multipartite graphs. Part I: Set numbers. 37-43 - Alewyn P. Burger, Jan H. van Vuuren:
Ramsey numbers in complete balanced multipartite graphs. Part II: Size numbers. 45-59 - AnAn Chang, Feng Tian, Aimei Yu:
On the index of bicyclic graphs with perfect matchings. 51-59 - Antonio Di Nola, Revaz Grigolia:
Pro-finite MV-spaces. 61-69 - Robert W. Fitzgerald, Joseph L. Yucas:
Pencils of quadratic forms over finite fields. 71-79 - Mariusz Grech, Andrzej Kisielewicz:
Direct product of automorphism groups of colored graphs. 81-86 - Ruth Haas, Thomas B. Wexler:
Signed domination numbers of a graph and its complement. 87-92 - Gena Hahn, Pierre Ille, Robert E. Woodrow:
Absorbing sets in arc-coloured tournaments. 93-99 - András Hajdu, Lajos Hajdu:
Approximating the Euclidean distance using non-periodic neighbourhood sequences. 101-111 - Angelika Hellwig, Lutz Volkmann:
Sufficient conditions for lambda'-optimality in graphs of diameter 2. 113-120 - Mohammad Hosseini Dolama, Éric Sopena, Xuding Zhu:
Incidence coloring of k-degenerated graphs. 121-128 - Mikio Kano, Gyula Y. Katona, Zoltán Király:
Packing paths of length at least two. 129-135 - David Kuo, Jing-Ho Yan:
On L(2, 1)-labelings of Cartesian products of paths and cycles. 137-144 - Rao Li:
Hamiltonicity of 2-connected quasi-claw-free graphs. 145-150 - Vadim V. Lozin, Dieter Rautenbach:
Chordal bipartite graphs of bounded tree- and clique-width. 151-158 - Nigel Martin:
Unbalanced star-factorisations of complete bipartite graphs. 159-165 - Konrad Pióro:
On some graph problem in the theory of partial algebras - Part I. 167-187 - Konrad Pióro:
On some graph problem in the theory of partial algebras - Part II. 189-204 - Laura A. Sanchis:
Relating the size of a connected graph to its total and restricted domination numbers. 205-216 - Lutz Volkmann, Stefan Winzen:
Cycles through a given arc and certain partite sets in almost regular multipartite tournaments. 217-229 - Ligong Wang, Xueliang Li, Cornelis Hoede:
Integral complete r-partite graphs. 231-241
- Weidong Gao, Xin Jin:
Weighted sums in finite cyclic groups. 243-247 - Mario Gionfriddo, Lorenzo Milazzo, Alexander Rosa, Vitaly I. Voloshin:
Bicolouring Steiner systems S(2, 4, v). 249-253 - T. Aaron Gulliver, Patric R. J. Östergård:
Binary optimal linear rate 1/2 codes. 255-261 - Roland Häggkvist, Robert Johansson:
A note on edge-decompositions of planar graphs. 263-266 - Keith E. Mellinger:
Classical mixed partitions. 267-271 - Petra Sparl, Janez Zerovnik:
Homomorphisms of hexagonal graphs to odd cycles. 273-277 - Dragan Stevanovic:
Bipartite density of cubic graphs: the case of equality. 279-281 - Jian Wang, Beiliang Du:
Kp, q-factorization of the complete bipartite graph Km, n. 283-287 - Li Zhang, Baoyindureng Wu:
Edge choosability of planar graphs without small cycles. 289-293
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-11-08 20:20 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:
