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 Volume=1
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Shuffles of permutations and the Kronecker product
A.M. Garsia
,
J. Remmel
Graphs and Combinatorics
1
, 1985, pp. 217-263
On a construction of critical graphs which are not sensitive
K.M. Koh
,
K.S. Poh
Graphs and Combinatorics
1
, 1985, pp. 265-270
Contact patterns of equal nonoverlapping spheres
Hiroshi Maehara
Graphs and Combinatorics
1
, 1985, pp. 271-282
Degree sets of degree uniform graphs
Christina M. Mynhardt
Graphs and Combinatorics
1
, 1985, pp. 283-290
Note on a Ramsey-Turán type problem
Vojtȇch Rödl
Graphs and Combinatorics
1
, 1985, pp. 291-293
A maximal cover of hexagonal systems
Mao-lin Zheng
,
Chen Rong-si
Graphs and Combinatorics
1
, 1985, pp. 295-298
Research problems -Subgraphs with large degrees and girth
Carsten Thomassen
Graphs and Combinatorics
1
, 1985, pp. 299-300
Matchings in
n
-partite
n
-graphs
Ron Aharoni
Graphs and Combinatorics
1
, 1985, pp. 303-304
Asynchronous threshold networks
Noga Alon
Graphs and Combinatorics
1
, 1985, pp. 305-310
The splitting number of the complete graph
Nora Hartsfield
,
Brad Jackson
,
Gerhard Ringel
Graphs and Combinatorics
1
, 1985, pp. 311-329
Hadamard Graphs - II
Noboru Ito
Graphs and Combinatorics
1
, 1985, pp. 331-337
Holes in oredered sets
Peter Neverman
,
Ivan Rival
Graphs and Combinatorics
1
, 1985, pp. 339-350
The binding number of line graphs and total graphs
Akira Saito
,
Tian Songlin
Graphs and Combinatorics
1
, 1985, pp. 351-356
Probabilistic methods
Joel Spencer
Graphs and Combinatorics
1
, 1985, pp. 357-382
Perfect matchings in hexagonal systems
Fu-ji Zhang
,
Chen Rong-si
,
Guo Xiao-fong
Graphs and Combinatorics
1
, 1985, pp. 383-386
Research problems - Hypergraphs with high chromatic number
Noga Alon
Graphs and Combinatorics
1
, 1985, pp. 387-389
Seiten
<
1
2