Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 282
Volume 282, Number 1-3, May 2004
- Encarnación Algaba Durán
, Jesús Mario Bilbao, René van den Brink, Andrés Jiménez-Losada:
Cooperative games on antimatroids. 1-15 - Martin Anthony:
Partitioning points by parallel planes. 17-21 - Marianna Bolla, Gábor Molnár-Sáska:
Optimization problems for weighted graphs and related correlation estimates. 23-33 - Prosenjit Bose, Michiel H. M. Smid, David R. Wood:
Light edges in degree-constrained graphs. 35-41 - Bostjan Bresar:
On subgraphs of Cartesian product graphs and S-primeness. 43-52 - Pierce G. Buckley, Deryk Osthus:
Popularity based random graph models leading to a scale-free degree sequence. 53-68 - Xiebin Chen, Qiuying Lin, Fuji Zhang:
The number of spanning trees in odd valent circulant graphs. 69-79 - YoungJu Choie, Patrick Solé:
Ternary codes and Jacobi forms. 81-87 - Emeric Deutsch:
Ordered trees with prescribed root degrees, node degrees, and branch lengths. 89-94 - Feng Ming Dong, Khee Meng Koh:
On upper bounds for real roots of chromatic polynomials. 95-101 - Feng Ming Dong:
The largest non-integer real zero of chromatic polynomials of graphs with fixed order. 103-112 - Jürgen Eckhoff:
A new Tura'n-type theorem for cliques in graphs. 113-122 - Chin-Mei Fu, Wen-Chung Huang, Yi-Hsin Shih, Yu-Ju Yaon:
Totally symmetric latin squares with prescribed intersection numbers. 123-136 - Marc P. C. Fossorier, Jaroslav Jezek, James B. Nation, Alex Pogel:
Ordinary graphs and subplane partitions. 137-148 - Jaroslaw Grytczuk:
Another variation on Conway's recursive sequence. 149-161 - Tayuan Huang, Chih-Wen Weng:
Pooling spaces and non-adaptive pooling designs. 163-169 - Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Binary codes from graphs on triples. 171-182 - Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña:
The clique operator on cographs and serial graphs. 183-191 - Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter:
A hierarchy of self-clique graphs. 193-208 - Valery A. Liskovets, Timothy R. S. Walsh:
Enumeration of eulerian and unicursal planar maps. 209-221 - Deirdre Luyckx, Joseph A. Thas:
Locally hermitian 1-systems of Q+(7, q). 223-231
- Makoto Araya, Masaaki Harada:
MDS codes over F9 related to the ternary Golay code. 233-237 - Pedro Berrizbeitia, Reinaldo E. Giudici:
On cycles in the sequence of unitary Cayley graphs. 239-243 - Ilaria Cardinali, Nicola Durante, Tim Penttila, Rocco Trombetti:
Bruen chains over fields of small order. 245-247 - Curtis Coker:
A family of eigensequences. 249-250 - Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
Competition polysemy. 251-255 - Miranca Fischermann, Werner Knoben, Dirk Kremer, Dieter Rautenbach:
The solution of two problems on bound polysemy. 257-261 - Martín Eduardo Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña:
Dismantlings and iterated clique graphs. 263-265 - Hung-Lin Fu, Shung-Liang Wu:
Cyclically decomposing the complete graph into cycles. 267-273 - Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
A counterexample to a conjecture on edge-coloured tournaments. 275-276 - Masasi Higasikawa:
There is no universal countable random-free graph. 277-279 - Guoce Xin:
Proof of a conjecture on the slit plane problem. 281-287
a service of 
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-04-22 20:03 CEST 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:
