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=78
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Circuit decompositions of Eulerian graphs
Genghua Fan
,
Cun-Quan Zhang
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 1-23
A classification of
DCI(CI)
-subsets for cyclic group of odd prime power order
Qiongxiang Huang
,
Jixiang Meng
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 24-34
Proof of a chromatic polynomial conjecture
F.M. Dong
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 35-44
The spectral radius of graphs on surfaces
M.N. Ellingham
,
Xiaoya Zha
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 45-56
A simple competitive graph coloring algorithm
H.A. Kierstead
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 57-68
The
k
-critical
2k
-connected graphs for
k\in\{3,4\}
Matthias Kriesell
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 69-80
Clique minors in graphs and their complements
Bruce Reed
,
Robin Thomas
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 81-85
On random graph homomorphisms into
Z
Itai Benjamini
,
Olle Häggström
,
Elchanan Mossel
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 86-114
Vertex partitions by connected monochromatic
k
-regular graphs
Gábor N. Sárközy
,
Stanley M. Selkow
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 115-122
Packing and decomposition of graphs with trees
Raphael Yuster
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 123-140
Gibbs measures and dismantlable graphs
Graham R. Brightwell
,
Peter Winkler
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 141-166
Exponential families of non-isomorphic triangulations of complete graphs
C. Paul Bonnington
,
M.J. Grannell
,
T.S. Griggs
,
J. S̑irán̑
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 169-184
Maximum balanced flow in a network
Haggai Ilani
,
Michael Lomonosov
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 185-197
Matchings in graphs on non-orientable surfaces
Glenn Tesler
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 198-231
Quasi-Hamiltonicity: A series of necessary conditions for a digraph to be Hamiltonian
Gregory Gutin
,
Anders Yeo
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 232-242
Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
Frédéric Havet
,
Stéphan Thomassé
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 243-273
The maximum size of 3-uniform hypergraphs not containing a Fano plane
Dominique de Caen
,
Zoltán Füredi
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 274-276
Equivalence of Fleischner's and Thomassen's conjectures
Martin Kochol
Journal of Combinatorial Theory Series B
78
(2), 2000, pp. 277-279