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=J. Comb.~Theory Series B AND YEAR=1998
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Reconstruction of posets with the same comparability graph
Pierre Ille
,
Jean-Xavier Rampon
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 368-377
Bicycle dimension and special points of the Tutte polynomial
Dirk Vertigan
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 378-396
An algorithm for packing connectors
J. Keijsper
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 397-404
Directed triangles in digraphs
Jian Shen
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 405-407
A note on the zeta function of a graph
Sam Northshield
Journal of Combinatorial Theory Series B
74
(2), 1998, pp. 408-410
Fractional kernels in digraphs
Ron Aharoni
,
Ron Holzman
Journal of Combinatorial Theory Series B
73
(1), 1998, pp. 1-6
Upper bounds on the size of obstructions and intertwines
Jens Lagergren
Journal of Combinatorial Theory Series B
73
(1), 1998, pp. 7-40
Half-transitive group actions on finite graphs of valency 4
Dragan Marus̑ic̑
Journal of Combinatorial Theory Series B
73
(1), 1998, pp. 41-76
A Nebeský-type characterization for relative maximum genus
Dan Archdeacon
,
C. Paul Bonnington
,
Jozef S̑irán̑
Journal of Combinatorial Theory Series B
73
(1), 1998, pp. 77-98
Nonregular graphs with three eigenvalues
Edwin R. van Dam
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 101-118
Hamiltonian decomposition of lexicographic products of digraphs
Lenhard L. Ng
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 119-129
An efficient algorithm for minimum-weight bibranching
J. Keijsper
,
R. Pendavingh
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 130-145
On the density of subgraphs in a graph with bounded independence number
Pavel Valtr
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 146-158
All unit-distance graphs of order 6197 are 6-colorable
Dan Pritikin
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 159-163
Isomorphisms of finite Cayley digraphs of bounded valency
Cai Heng Li
,
Cheryl E. Praeger
,
Ming Yao Xu
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 164-183
On packing connectors
J. Keijsper
,
A. Schrijver
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 184-188
You can't paint yourself into a corner
Michael O. Albertson
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 189-194
Pattern periodic coloring of distance graphs
Xuding Zhu
Journal of Combinatorial Theory Series B
73
(2), 1998, pp. 195-206
Flows, view obstructions, and the Lonely Runner
Wojciech Bienia
,
Luis Goddyn
,
Pavol Gvozdjak
,
András Sebŏ
,
Michael Tarsi
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 1-9
Subdivisions in planar graphs
Xingxing Yu
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 10-52
Ramsey-type theorems for spatial graphs and good drawings
Seiya Negami
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 53-62
A Petersen on a pentagon
Paul Seymour
,
Klaus Truemper
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 63-79
An infinite series of surfaces with known 1-chromatic number
Vladimir P. Korzhik
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 80-90
A vertex-splitting lemma, de Werra's theorem, and improper list colourings
A.J.W. Hilton
,
D.S.G. Stirling
,
T. Slivnik
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 91-103
Independent dominating sets and a second Hamiltonian cycle in regular graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 104-109
Seiten
<
1
2
3
>