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 Volume=72
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
On Hamiltonicity of vertex-transitive graphs and digraphs of order
p^4
Yu Qing Chen
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 110-121
Counting 1-factors in regular bipartite graphs
Alexander Schrijver
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 122-135
A splitter for graphs with no Petersen family minor
John Maharry
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 136-139
The solution of a problem of Godsil on cubic Cayley graphs
Cai Heng Li
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 140-142
Intersections of longest cycles in
k
-connected graphs
Guantao Chen
,
Ralph J. Faudree
,
Ronald J. Gould
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 143-149
A note on list arboricity
P.D. Seymour
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 150-151
A characterization of graphs having all
(g,f)
-factors
Thomas Niessen
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 152-156
A characterization of unique tournaments
Prasad Tetali
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 157-159
Any knot is inevitable in a regular projection of a planar graph
Tatsuya Tsukamoto
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 161-180
2-partition-transitive tournaments
Barry Guiduli
,
András Gyárfás
,
Stéphan Thomassé
,
Peter Weidl
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 181-196
Triangle-free circuit decompositions and Petersen minor
Katherine Heinrich
,
Jiping Liu
,
Cun-Quan Zhang
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 197-207
On the connectivity of graphs embedded in surfaces
Michael D. Plummer
,
Xiaoya Zha
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 208-228
Chromatic coefficients of linear uniform hypergraphs
Ioan Tomescu
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 229-235
List homomorphisms to reflexive graphs
Tomas Feder
,
Pavol Hell
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 236-250
On the roots of chromatic polynomials
Jason I. Brown
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 251-256
A note on
k
-connected rayless graphs
Rudolf Halin
Journal of Combinatorial Theory Series B
72
(2), 1998, pp. 257-260