default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 190
Volume 190, Numbers 1-3, August 1998
- R. Julian R. Abel, Frank E. Bennett:
The existence of perfect Mendelsohn designs with block size 7. 1-14 - Denise Amar, Olivier Togni:
Irregularity strength of trees. 15-38 - Artur Andrzejak:
An algorithm for the Tutte polynomials of graphs of bounded treewidth. 39-54 - Esther M. Arkin, Refael Hassin:
Graph partitions with minimum degree constraints. 55-65 - S. Arumugam
, J. Suresh Suseela:
Acyclic graphoidal covers and path partitions in a graph. 67-77 - Anant P. Godbole, Laura K. Potter, Erik Jonathan Sandquist:
Sign-balanced covering matrices. 79-93 - Gregory Z. Gutin, Vadim E. Zverovich:
Upper domination and upper irredundance perfect graphs. 95-105 - Hugh Hind, Yue Zhao:
Edge colorings of graphs embeddable in a surface of low genus. 107-114 - Khee Meng Koh, Eng Guan Tay:
On optimal orientations of cartesian products of graphs (I). 115-136 - Krzysztof Kolodziejczyk:
The boundary characteristic and the volume of lattice polyhedra. 137-148 - Vladimir P. Korzhik:
Triangular embeddings of Kn-Km with unboundedly large m. 149-162 - Dieter Kratsch, Jean-Xavier Rampon:
Tree-visibility orders. 163-175 - S. B. Mulay, Carl G. Wagner:
Finitary bases and formal generating functions. 177-189 - Sanjay Rajpal:
On binary k-paving matroids and Reed-Muller codes. 191-200 - Vassil Yorgov:
The extremal codes of length 42 with automorphism of order 7. 201-213 - Xuding Zhu:
Chromatic Ramsey numbers. 215-222 - Riste Skrekovski:
Choosability of K5-minor-free graphs. 223-226 - Eberth Alarcon:
An extremal result on convex lattice polygons. 227-234 - Elena Barcucci, Sara Brunetti, Alberto Del Lungo, Francesco Del Ristoro:
A combinatorial interpretation of the recurrence fn+1 = 6fn - fn-1. 235-240 - Louis Caccetta, Rui-Zhong Jia:
On a problem concerning ordered colourings. 241-245 - Neil J. Calkin:
On the structure of a random sum-free set of positive integers. 247-257 - Andrzej Ehrenfeucht, Tero Harju, Paulien ten Pas, Grzegorz Rozenberg:
Permutations, parenthesis words, and Schröder numbers. 259-264 - Wolf H. Holzmann, Hadi Kharaghani:
A D-optimal design of order 150. 265-269 - David Moews:
Optimally pebbling hypercubes and powers. 271-276 - Timothy B. Moorhouse, Derek G. Corneil:
Completeness for intersection classes. 277-286 - Lior Pachter, Peter Kim:
Forcing matchings on square grids. 287-294 - Gerhard J. Woeginger:
The toughness of split graphs. 295-297
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 2025-12-04 01:29 CET 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:
