default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 128
Volume 128, Numbers 1-3, April 1994
- Marianna Bolla, Gábor E. Tusnády:
Spectra and optimal partitions of weighted graphs. 1-20 - Oleg V. Borodin:
Simultaneous coloring of edges and faces of plane graphs. 21-33 - Rebecca Calahan Zijlstra, Robert B. Gardner:
Bicyclic Steiner triple systems. 35-44 - Vladimir Cepulic:
On symmetric block designs (40, 13, 4) with automorphisms of order 5. 45-60 - Jiansheng Chen:
Sharp bound of the kth eigenvalue of trees. 61-72 - Jianer Chen, Jonathan L. Gross, Robert G. Rieper:
Overlap matrices and total imbedding distributions. 73-94 - Reid Davis, Carl G. Wagner:
Covering algebras and q-binomial generating functions. 95-111 - Andrzej Ehrenfeucht, Tero Harju
, Grzegorz Rozenberg:
Incremental construction of 2-structures. 113-141 - Hung-Lin Fu, Wei-Hsin Hu:
Disjoint odd integer subsets having a constant odd sum. 143-150 - Daniel M. Gordon, Robert W. Robinson, Frank Harary:
Minimum degree games for graphs. 151-163 - Frank Harary, Terry A. McKee:
The square of a chordal graph. 165-172 - Bert L. Hartnell, Douglas F. Rall:
Bounds on the bondage number of a graph. 173-177 - Anthony J. W. Hilton, Dominique de Werra:
A sufficient condition for equitable edge-colourings of simple graphs. 179-201 - Xiang-dong Hou:
Classification of cosets of the Reed-Muller code R(m-3, m). 203-224 - Rosa Huang, Gian-Carlo Rota:
On the relations of various conjectures on Latin squares and straightening coefficients. 225-236 - Glenn Hurlbert:
The antipodal layers problem. 237-245 - Alexander V. Ivashchenko:
Graphs of spheres and tori. 247-255 - Hiroshi Kimura:
Classification of Hadamard matrices of order 28 with hall sets. 257-268 - Dieter Kratsch, Peter Damaschke, Anna Lubiw:
Dominating cliques in chordal graphs. 269-275 - Mirko Lepovic:
Some kinds of energies of graphs. 277-282 - Ying Miao:
Existence of resolvable BIBDs with k = 5 and lambda = 4. 283-303 - Alexander Rosa, Stefan Znám:
Packing pentagons into complete graphs: how clumsy can you get? 305-316 - Iwao Sato:
Isomorphisms of some graph coverings. 317-326 - Chung-Piaw Teo, Khee Meng Koh:
On chromatic uniqueness of uniform subdivisions of graphs. 327-335 - Tran van Trung:
Some existence theorems for t-designs. 337-348 - Takao Ueda:
Graphs of nonsingular threshold transformations. 349-359 - L. Wang, S. Stueckle:
Symmetries of drawings of sets of cycles and chromatic automorphisms. 361-369 - Guo-Hui Zhang:
Pseudo-one-factorizations of regular graphs of odd order - II. products of graphs. 371-384 - Abdelhafid Berrachedi:
A new characterization of median graphs. 385-387 - Rudolf Ahlswede, Gábor Simonyi:
On the optimal structure of recovering set pairs in lattices: the sandglass conjecture. 389-394 - Jørgen Bang-Jensen, Pavol Hell:
On chordal proper circular arc graphs. 395-398 - Garry L. Johns:
A simple proof of the characterization of antipodal graphs. 399-400 - Patrick Solé, Thomas Zaslavsky:
Maximality of the cycle code of a graph. 401-405 - Michal Tkác:
On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles. 407-413 - Ming-Yao Xu:
Vertex-primitive digraphs of prime-power order are hamiltonian. 415-417
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:
