default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 281
Volume 281, Number 1-3, April 2004
- Peter Adams, Mohammad Mahdian, Ebadollah S. Mahmoodian:
On the forced matching numbers of bipartite graphs. 1-12 - Dan Archdeacon, C. Paul Bonnington
, Jozef Sirán:
Halin's theorem for cubic graphs on an annulus. 13-25 - David James Ashe, Hung-Lin Fu, Christopher A. Rodger:
A solution to the forest leave problem for partial 6-cycle systems. 27-41 - Iliya Bouyukliev, Markus Grassl, Zlatko Varbanov:
New bounds for n4(k, d) and classification of some optimal codes over GF(4). 43-66 - Petter Brändén:
q-Narayana numbers and the flag h-vector of J(2?n). 67-81 - Haitao Cao, Beiliang Du:
Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes. 83-95 - Neil P. Carnes, Anne Dye, James F. Reed:
The spectrum of bicyclic antiautomorphisms of directed triple systems. 97-114 - Denis Chebikin:
On k-edge-ordered graphs. 115-128 - Andrzej Czygrinow, Brendan Nagle:
Bounding the strong chromatic index of dense random graphs. 129-136 - Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart:
Maximum sizes of graphs with given domination parameters. 137-148 - Kinkar Chandra Das, Pawan Kumar:
Some new bounds on the spectral radius of graphs. 149-161 - Charles Delorme, Isabel Marquez, Oscar Ordaz, Asdrubal Ortuño:
Existence conditions for barycentric sequences. 163-172 - Joanna A. Ellis-Monaghan:
Exploring the Tutte-Martin connection. 173-187 - Sen-Peng Eu, Shu-Chung Liu, Yeong-Nan Yeh:
Odd or even on plane trees. 189-196 - Joshua Evan Greene:
Chromatic capacities of graphs and hypergraphs. 197-207 - Wenjie He, Jiaojiao Wu, Xuding Zhu:
Relaxed game chromatic number of trees and outerplanar graphs. 209-219 - Charles E. Killian, Carla D. Savage:
Antipodal Gray codes. 221-236 - Tomaz Pisanski, Thomas W. Tucker, Arjana Zitnik:
Straight-ahead walks in Eulerian graphs. 237-246 - Miri Priesler, Michael Tarsi:
On some multigraph decomposition problems and their computational complexity. 247-254 - Lutz Volkmann:
All regular multipartite tournaments that are cycle complementary. 255-266 - Lutz Volkmann, Anders Yeo:
Hamiltonian paths, containing a given path or collection of arcs, in close to regular multipartite tournaments. 267-276 - Haixing Zhao, Xueliang Li, Shenggui Zhang, Ruying Liu:
On the minimum real roots of the -polynomials and chromatic uniqueness of graphs. 277-294 - Xiqiang Zhao, Shuangshuang Ding, Tingming Wang:
Some summation rules related to the Riordan arrays. 295-307
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-10-30 20:41 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:
