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=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Anti-Ramsey colorings in several rounds
Aart Blokhuis
,
Ralph Faudree
,
András Gyárfás
,
Miklós Ruszinkó
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 1-18
A matrix method for chromatic polynomials
Norman Biggs
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 19-29
Fragmentability of graphs
Keith Edwards
,
Graham Farr
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 30-37
Line graphs and forbidden induced subgraphs
Hong-Jian Lai
,
L̑ubomír S̑oltés
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 38-55
Bicliques and eigenvalues
Willem H. Haemers
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 56-66
Long cycles through a linear forest
Zhiquan Hu
,
Feng Tian
,
Bing Wei
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 67-80
A degree sum condition for the existence of a contractible edge in a
_K
-connected graph
Matthias Kriesell
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 81-101
Face covers and the genus problem for apex graphs
Bojan Mohar
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 102-117
4-regular maps on the Klein bottle
Han Ren
,
Yanpei Liu
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 118-137
Directed tree-width
Thor Johnson
,
Neil Robertson
,
P.D. Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 138-154
Regular graphs with no homomorphisms onto cycles
I.M. Wanless
,
N.C. Wormald
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 155-160
Drawings of
C_m \times C_n
with one disjoint family II
Hector A. Juarez
,
Gelasio Salazar
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 161-165
A new upper bound on the Cheeger number of a graph
Sorin Dragomir
,
Elisabetta Barletta
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 167-174
A characterisation of Pfaffian near bipartite graphs
Ilse Fischer
,
Charles H.C. Little
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 175-222
Steinitz representations of polyhedra and the Colin de Verdière number
László Lovász
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 223-236
On the largest component of the random graph at a nearcritical stage
Boris Pittel
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 237-269
Covering non-uniform hypergraphs
Endre Boros
,
Yair Caro
,
Zoltán Füredi
,
Raphael Yuster
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 270-284
On structure of some plane graphs with application to choosability
Peter Che Bor Lam
,
Wai Chee Shiu
,
Baogang Xu
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 285-296
Hamiltonicity and minimum degree in 3-connected claw-free graphs
Odile Favaron
,
Pierre Fraisse
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 297-305
All 4-connected line graphs of claw free graphs are Hamiltonian connected
Matthias Kriesell
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 306-315
K_r
-free uniquely vertex colorable graphs with minimum possible edges
S. Akbari
,
V.S. Mirrokni
,
B.S. Sadjad
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 316-318
A short proof of Mader's
S
-paths theorem
Alexander Schrijver
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 319-321
A generalization of a theorem of Dirac
Tristan Denley
,
Haidong Wu
Journal of Combinatorial Theory Series B
82
(2), 2001, pp. 322-326