default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 122
Volume 122, Numbers 1-3, November 1993
- Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
On the honesty of graph complements. 1-6 - Paola Bandieri
:
Contracted k-tessellations of closed surfaces. 7-13 - Béla Bollobás, Imre Leader:
Maximal sets of given diameter in the grid and the torus. 15-35 - Haitze J. Broersma, Jan van den Heuvel, Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions. 37-49 - Richard A. Brualdi, Jennifer J. Quinn Massey:
Incidence and strong edge colorings of graphs. 51-58 - William Y. C. Chen:
The theory of compositionals. 59-87 - Ernest J. Cockayne, Christina M. Mynhardt:
The sequence of upper and lower domination, independence and irredundance numbers of a graph. 89-102 - Karen L. Collins:
Factoring distance matrix polynomials. 103-112 - Sandip Das, Malay K. Sen:
An interval digraph in relation to its associated bipartite graph. 113-136 - Clelia de Felice:
A partial result about the factorization conjecture for finite variable-length codes. 137-152 - T. C. Enns:
Hamiltonian circuits and paths in subset graphs with circular adjacency. 153-165 - Hortensia Galeana-Sánchez:
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. 167-177 - Pierre Hansen, Maolin Zheng:
A linear algorithm for perfect matching in hexagonal systems. 179-196 - Frank Harary, Serge Lawrencenko, Vladimir P. Korzhik:
Realizing the chromatic numbers of triangulations of surfaces. 197-204 - Peter Horák, Zsolt Tuza:
Large s-representable set systems with low maximum degree. 205-217 - Alexander V. Ivashchenko:
Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs. 219-233 - Krzysztof Kolodziejczyk:
Borsuk covering and planar sets with unique completion. 235-244 - Renu C. Laskar, S. Stueckle, Barry L. Piazza:
On the edge-integrity of some graphs and their complements. 245-253 - Charles Laywine:
A counter-example to a conjecture relating complete sets of frequency squares and affine geometries. 255-262 - Giuseppe Pirillo:
On a combinatorial property of Fibonacci semigroup. 263-267 - Richard L. Roth:
Perfect colorings of multipatterns in the plane. 269-286 - Edward G. Thurber:
Addition chains - an erratic sequence. 287-305 - Arthur T. White:
Treble dodging minor methods: ringing the cosets, on six bells. 307-323 - Min-Li Yu:
On path factorizations of complete multipartite graphs. 325-333 - Jochen Harant:
An upper bound for the radius of a 3-connected graph. 335-341 - Stanley M. Selkow:
The independence number of graphs in terms of degrees. 343-348 - Miklós Bóna:
A Euclidean Ramsey theorem. 349-352 - Denis Hanson, Gary MacGillivray, Dale Youngs:
The size of a minimum five-chromatic K4-free graph. 353-355 - Xing-De Jia:
Some remarks on minimal bases and maximal nonbases of integers. 357-362 - Chunhui Lai:
On the size of graphs with all cycle having distinct length. 363-364 - Nian-Zu Li, Earl Glen Whitehead Jr.:
The chromaticity of certain graphs with five triangles. 365-372 - Marko Lovrecic Sarazin:
On the hamiltonian index of a graph. 373-376 - Eduardo Montenegro, Reinaldo Salazar:
A result about the incident edges in the graphs Mk. 377-380 - Sergiu Rudeanu:
Unique solutions of Boolean ring equations. 381-383 - Matthias F. M. Stallmann:
On counting planar embeddings. 385-392 - Ulrich Teschner:
A counterexample to a conjecture on the bondage number of a graph. 393-395
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-05 22:38 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:
