Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 80
Volume 80, Number 1, February 1990
- Stefan Arnborg, Andrzej Proskurowski, Derek G. Corneil:
Forbidden minors characterization of partial 3-trees. 1-19 - Ehab S. Elmallah, Charles J. Colbourn:
On two dual classes of planar graphs. 21-40 - Jean-Luc Fouquet, Henri Thuillier:
On some conjectures on cubic 3-connected graphs. 41-57 - Oded Goldreich
:
On the number of monochromatic close pairs of beads in a rosary. 59-68 - Haoru Huang, Norman L. Johnson:
8 semifield planes of order 82. 69-79 - P. Katerinis:
Toughness of graphs and the existence of factors. 81-92 - Mohan S. Shrikhande, Navin M. Singhi:
An elementary derivation of the annihilator polynomial for extremal (2s + 1)-designs. 93-96 - David Gluck:
A note on permutation polynomials and finite geometries. 97-100 - Alan R. Prince:
The commutative ring of a symmetric design. 101-103 - G. Ravindra:
Problems 121-127. Posed by G. Rayindra. 105-109
Volume 80, Number 2, March 1990
- M. D. Atkinson, Alberto Negro, Nicola Santoro:
Sums of lexicographically ordered sets. 115-122 - Jason I. Brown, David Kelly, Johanan Schönheim, Robert E. Woodrow:
Graph coloring satisfying restraints. 123-143 - Peter Flach, Lutz Volkmann:
Estimations for the domination number of a graph. 145-151 - Neil Hindman:
On creating sets with large lower density. 153-157 - Mikio Kano:
Sufficient conditions for a graph to have factors. 159-165 - Dragan Marusic:
Hamiltonicity of tree-like graphs. 167-173 - S. Stueckle:
Chromatic automorphisms and symmetries of some graphs. 175-181 - Dennis E. White:
Hybrid tableaux and the Littlewood- Richardson rule. 183-206 - Doron Zeilberger:
A fast algorithm for proving terminating hypergeometric identities. 207-211 - Yanling Yang:
On a conjecture about monochromatic flats. 213-216 - H. P. Yap:
Corrigendum to: on graphs critical with respect to edge-colourings. 223
Volume 80, Number 3, March 1990
- Pascale Charpin:
Codes cycliques étendus affines-invariants et antichaines d'un ensemble partiellement ordonne. 229-247 - William Edwin Clark, Larry A. Dunning, Douglas G. Rogers:
Binary set functions and parity check matrices. 249-265 - Richard Z. Goldstein, Edward C. Turner:
Counting orbits of a product of permutations. 267-272 - Charles C. Lindner, Christopher A. Rodger, Douglas R. Stinson:
Small embeddings for partial cycle systems of odd length. 273-280 - Stephan Olariu:
Wings and perfect graphs. 281-296 - A. G. Robinson, Alan J. Goldman:
On ringeisen's isolation game. 297-312 - Raffaele Scapellato:
On F-geodetic graphs. 313-325 - Matthias Middendorf, Frank Pfeiffer:
On the complexity of recognizing perfectly orderable graphs. 327-333 - Sherman Stein:
The notched cube tiles Rn. 335-337
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-24 23:24 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:
