default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 270
Volume 270, Number 1-3, August 2003
- To the Readers and... . Discret. Math. 270(1-3): 1- (2003)
- Terry A. McKee:
Subgraph trees in graph theory. 3-12 - Martin Bokler:
Lower bounds for the cardinality of minimal blocking sets in projective spaces. 13-31 - Anthony Bonato:
Homomorphisms and amalgamation. 32-41 - Alexis Bonnecaze, YoungJu Choie
, Steven T. Dougherty, Patrick Solé:
Splitting the shadow. 42-59 - Marc Chastand, Norbert Polat:
Reconstruction of infinite locally finite connected graphs. 60-97 - Dameng Deng, Rolf S. Rees, Hao Shen:
Further results on nearly Kirkman triple systems with subsystems. 98-113 - Yoshimi Egawa, Mariko Hagita, Ken-ichi Kawarabayashi, Hong Wang:
Covering vertices of a graph by k disjoint cycles. 114-124 - Katalin Friedl, Lajos Rónyai:
Order shattering and Wilson's theorem. 126-135 - Aicke Hinrichs, Christian Richter:
New sets with large Borsuk numbers. 136-146 - Xiang-Dong Hou:
Rings and constructions of partial difference sets. 148-175 - Franz Lehner:
Cumulants, lattice paths, and orthogonal polynomials. 176-190 - Manoel Lemos:
Matroids with many common bases. 192-204 - Vito Napolitano:
On a class of finite linear spaces with few lines. 206-223 - Vito Napolitano:
Erratum to "On a class of finite linear spaces with few lines": [Discrete Mathematics 270 (2003) 207-224]. 224-225 - Oliver Pretzel:
On reorienting graphs by pushing down maximal vertices--II. 226-239 - Dieter Rautenbach, Lutz Volkmann:
On alphargammas(k)-perfect graphs. 240-249 - Lingsheng Shi:
Upper bounds for Ramsey numbers. 250-264 - Bertran Steinsky:
Enumeration of labelled chain graphs and labelled essential directed acyclic graphs. 266-277 - Paul Thomas Young:
Congruences for degenerate number sequences. 278-288 - M. H. Armanious:
Semi-planar Steiner loops of cardinality 2n. 290-297 - Toru Kojima:
Bandwidth of the composition of two graphs. 298-308 - Jixiang Meng, Zhao Zhang:
Number of minimum vertex cuts in transitive graphs. 310-316 - Jian-Hua Yin, Jiong-Sheng Li, Guo-Liang Chen:
The smallest degree sum that yields potentially kCl-graphic sequences. 318-326 - Michael Böttcher, Ulrich Knauer:
Postscript: "Endomorphism spectra of graphs" [Discrete Mathematics 109 (1992) 45-57]. 328-330 - Darla Kremer:
Postscript: "Permutations with forbidden subsequences and a generalized Schro"der number" [Discrete Mathematics 218 (2000) 121-130]. 332-333
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 2026-05-20 23:15 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:
