Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Graphs and Combinatorics AND YEAR=1993
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Long paths and cycles in tough graphs
H.J. Broersma
,
J. van den Heuvel
,
H.A. Jung
,
H.J. Veldman
Graphs and Combinatorics
9
, 1993, pp. 3-17
On the vertex packing problem
C. de Simone
Graphs and Combinatorics
9
, 1993, pp. 19-30
Sperner capacities
L. Gargano
,
J. Körner
,
U. Vaccaro
Graphs and Combinatorics
9
, 1993, pp. 31-46
The excess of complex Hadamard matrices
H. Kharaghani
,
Jennifer Seberry
Graphs and Combinatorics
9
, 1993, pp. 47-56
Gadget classification
Martin Loebl
Graphs and Combinatorics
9
, 1993, pp. 57-62
P
-partitions and the plactic congruence
Claudia Malvenuto
Graphs and Combinatorics
9
, 1993, pp. 63-73
The classification of closed surfaces using colored graphs
Andrew Vince
Graphs and Combinatorics
9
, 1993, pp. 75-84
Triple placement of graphs
Mariusz Woźniak
,
A. Paweƚ Wojda
Graphs and Combinatorics
9
, 1993, pp. 85-91
Research problems - Symmetric association schemes of class 2
Hiroshi Iwane
Graphs and Combinatorics
9
, 1993, pp. 93-94
Reflecting a triangle in the plane
Imre Bárány
,
Peter Frankl
,
Hiroshi Maehara
Graphs and Combinatorics
9
, 1993, pp. 97-104
Multi-set designs and numbers of common triples
Elizabeth J. Billington
,
E.S. Mahmoodian
Graphs and Combinatorics
9
, 1993, pp. 105-115
A problem related to Foulke's conjecture
C. Coker
Graphs and Combinatorics
9
, 1993, pp. 117-134
The cut cone III: On the role of triangle facets
Michel Deza
,
Monique Laurent
,
Svatopluk Poljak
Graphs and Combinatorics
9
, 1993, pp. 135-152
On the average genus of a graph
Jonathan L. Gross
,
E. Ward Klein
,
Robert G. Rieper
Graphs and Combinatorics
9
, 1993, pp. 153-162
More zeros of Krawtchouk polynomials
Laurent Habsieger
,
Dennis Stanton
Graphs and Combinatorics
9
, 1993, pp. 163-172
Most unbreakable murky graphs are bull-free
Alain Hertz
Graphs and Combinatorics
9
, 1993, pp. 173-175
An upper bound for van der Waerden-like numbers using
k
colors
Bruce M. Landman
Graphs and Combinatorics
9
, 1993, pp. 177-184
Regular sets of matrices and applications
Jennifer Seberry
,
Xian-Mo Zhang
Graphs and Combinatorics
9
, 1993, pp. 185-195
On the maximum number of distinct factors of a binary string
Jeffrey Shallit
Graphs and Combinatorics
9
, 1993, pp. 197-200
A correlation inequality for bipartite graphs
Alexander Sidorenko
Graphs and Combinatorics
9
, 1993, pp. 201-204
A counterexample to conjecture of Barefoot, Harary, and Jones
Janez Z̑erovnik
,
Jolana Oplerova
Graphs and Combinatorics
9
, 1993, pp. 205-207
On a criterion for matchability in hypergraphs
Ron Aharoni
Graphs and Combinatorics
9
, 1993, pp. 209-212
Askey-Wilson polynomials, kernel polynomials and association schemes
Laura M. Chihara
Graphs and Combinatorics
9
, 1993, pp. 213-223
Triplets and hexagons
Miles Hoare
Graphs and Combinatorics
9
, 1993, pp. 225-233
The independent domination number of a cubic 3-connected graph can be much larger than its domination number
A.V. Kostochka
Graphs and Combinatorics
9
, 1993, pp. 235-237
Seiten 1
2
>