![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Discrete Mathematics, Volume 273
Volume 273, Number 1-3, December 2003
- Jaroslav Nesetril
, Marc Noy, Oriol Serra:
Foreword. 1-6 - Guest Editors. Discret. Math. 273(1-3): 7- (2003)
- Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Extremal problems under dimension constraints. 9-21 - Rudolf Ahlswede, Harout K. Aydinian, Levon H. Khachatrian:
Maximal antichains under dimension constraints. 23-29 - Noga Alon:
Problems and results in extremal combinatorics--I. 31-53 - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Vertices of degree 6 in a contraction critically 6-connected graph. 55-69 - Alex R. Berg, Bill Jackson, Tibor Jordán:
Edge splitting and connectivity augmentation in directed hypergraphs. 71-84 - Vincent Bouchitté, Frédéric Mazoit
, Ioan Todinca:
Chordal embeddings of planar graphs. 85-102 - Peter J. Cameron
:
Random strongly regular graphs? 103-114 - Cyril Gavoille, Christophe Paul
:
Distance labeling scheme and split decomposition. 115-130 - Daniel Krob, Jean Mairesse, Ioannis Michos:
Computing the average parallelism in trace monoids. 131-162 - Uwe Leck:
On the orthogonal product of simplices and direct products of truncated Boolean lattices. 163-172 - Martin Loebl
, Jaroslav Nesetril
, Bruce A. Reed:
A note on random homomorphism from arbitrary graphs to Z. 173-181 - Colin McDiarmid, Bruce A. Reed:
Channel assignment on graphs of bounded treewidth. 183-192 - Oleg Pikhurko:
Further asymptotic size Ramsey results obtained via linear programming. 193-202 - Robert Sámal
:
Antisymmetric flows and strong oriented coloring of planar graphs. 203-209 - Susumu Suzuki, Toshihide Ibaraki:
Average running time analysis of an algorithm to calculate the size of the union of Cartesian products. 211-220 - David R. Wood
:
Geometric thickness in a grid. 221-234 - Nicholas C. Wormald:
Analysis of greedy algorithms on graphs with bounded degrees. 235-260 - Hong-Gwa Yeh, Xuding Zhu:
4-Colorable 6-regular toroidal graphs. 261-274
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.