Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 188
Volume 188, Numbers 1-3, June 1998
- Rudolf Ahlswede, Zen Zhang:
Code pairs with specified parity of the Hamming distances. 1-11 - Salar Y. Alsardary, Jerzy Wojciechowski:
The basis number of the powers of the complete graph. 13-25 - Ahmed M. Assaf:
Directed covering with block size 5 and index even. 27-40 - Bhaskar Bagchi, Basudeb Datta:
A structure theorem for pseudomanifolds. 41-60 - Jørgen Bang-Jensen
, Gregory Z. Gutin:
Alternating cycles and trails in 2-edge-coloured complete multigraphs. 61-72 - Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Éric Sopena:
On universal graphs for planar oriented graphs of a given girth. 73-85 - Niall Cairnie, Keith Edwards:
The achromatic number of bounded degree trees. 87-97 - James A. Davis:
New semiregular divisible difference sets. 99-109 - A. M. H. Gerards, F. Bruce Shepherd:
Strong orientations without even directed circuits. 111-125 - Masaaki Harada, T. Aaron Gulliver, Hitoshi Kaneta:
Classification of extremal double-circulant self-dual codes of length up to 62. 127-136 - Mirko Lepovic:
On formal products and spectra of graphs. 137-149 - Mingchu Li:
Vertex pancyclism in claw-free graphs. 151-173 - Xueliang Li:
Edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph: A connectedness theorem. 175-182 - Eckhard Steffen:
Classifications and characterizations of snarks. 183-203 - Stevo Todorcevic:
Countable chain condition in partition calculus. 205-223 - Liming Xiong:
Edge degree conditions for subpancyclicity in line graphs. 225-232 - Beifang Chen, Serge Lawrencenko:
Structural characterization of projective flexibility. 233-238 - Jochen Harant:
A lower bound on the independence number of a graph. 239-243 - Iliya Bluskov:
Some t-designs are minimal (t + 1)-coverings. 245-251 - Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt:
Irredundant and perfect neighbourhood sets in trees. 253-260 - N. I. Glebov, Alexandr V. Kostochka:
On the independent domination number of graphs with given minimum degree. 261-266 - Olof Heden:
Another Bruen chain. 267 - Xinming Liu, Douglas B. West:
Line digraphs and coreflexive vertex sets. 269-277 - M. R. Sridharan, K. Balaji:
Characterisation of self-complementary chordal graphs. 279-283 - Litong Xie, Guizhen Liu, Baogang Xu:
On endo-homology of complexes of graphs. 285-291 - Likuan Zhao:
The kissing number of the regular polygon. 293-296 - Nedyalko Dimov Nenov:
On the small graphs with chromatic number 5 without 4-cliques. 297-298
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-18 20:21 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:
