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=2014
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spanning closed walks and TSP in 3-connected planar graphs
Ken-ichi Kawarabayashi
,
Kenta Ozeki
Journal of Combinatorial Theory Series B
109
, 2014, pp. 1-33
Hamilton cycles in dense vertex-transitive graphs
Demetres Christofides
,
Jan Hladký
,
András Máthé
Journal of Combinatorial Theory Series B
109
, 2014, pp. 34-72
Ore's conjecture on color-critical graphs is almost true
Alexandr Kostochka
,
Matthew Yancey
Journal of Combinatorial Theory Series B
109
, 2014, pp. 73-101
Colouring edges with many colours in cycles
J. Nes̑etȓil
,
P. Ossona de Mendez
,
X. Zhu
Journal of Combinatorial Theory Series B
109
, 2014, pp. 102-119
What is Ramsey-equivalent to a clique?
Jacob Fox
,
Andrey Grinshpun
,
Anita Liebenau
,
Yury Person
,
Tibor Szabó
Journal of Combinatorial Theory Series B
109
, 2014, pp. 120-133
Colouring graphs when the number of colours is almost the maximum degree
Michael Molloy
,
Bruce Reed
Journal of Combinatorial Theory Series B
109
, 2014, pp. 134-195
The inducibility of blow-up graphs
Hamed Hatami
,
James Hirst
,
Serguei Norine
Journal of Combinatorial Theory Series B
109
, 2014, pp. 196-212
On generalized Ramsey numbers of Erdŏs and Rogers
Andrzej Dudek
,
Troy Retter
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
109
, 2014, pp. 213-227
Tournaments with near-linear transitive subsets
Krzysztof Choromanski
,
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
109
, 2014, pp. 228-249
On the number of
K_4
-saturating edges
József Balogh
,
Hong Liu
Journal of Combinatorial Theory Series B
109
, 2014, pp. 250-257
An entropy argument for counting matroids
N. Bansal
,
R.A. Pendavingh
,
J.G. van der Pol
Journal of Combinatorial Theory Series B
109
, 2014, pp. 258-262
The stable set polytope of claw-free graphs with stability number at least four. II. Striped graphs are
\mathcal G
-perfect
A. Galluccio
,
C. Gentile
,
P. Ventura
Journal of Combinatorial Theory Series B
108
, 2014, pp. 1-28
On the ultimate categorical independence ratio
Ágnes Tóth
Journal of Combinatorial Theory Series B
108
, 2014, pp. 29-39
Forbidden minor characterizations for low-rank optimal solutions to semidefinite programs over the elliptope
M. E.-Nagy
,
M. Laurent
,
A. Varvitsiotis
Journal of Combinatorial Theory Series B
108
, 2014, pp. 40-80
Group flow, complex flow, unit vector flow, and the
(2+\epsilon)
-flow conjecture
Carsten Thomassen
Journal of Combinatorial Theory Series B
108
, 2014, pp. 81-91
An improved error term for minimum
H
-decomositions of graphs
Peter Allen
,
Julia Böttcher
,
Yury Person
Journal of Combinatorial Theory Series B
108
, 2014, pp. 92-101
On distance-regular Cayley graphs on Abelian groups
S̑tefko Miklavic̑
,
Primoz̑ S̑parl
Journal of Combinatorial Theory Series B
108
, 2014, pp. 102-122
Internally 4-connected projective-planar graphs
Guoli Ding
,
Perry Iverson
Journal of Combinatorial Theory Series B
108
, 2014, pp. 123-138
Domination in transitive colorings of tournaments
Dömötör Pálvölgyi
,
András Gyárfás
Journal of Combinatorial Theory Series B
107
, 2014, pp. 1-11
A characterization of a family of edge-transitive metacirculant graphs
Cai Heng Li
,
Jiangmin Pan
,
Shu Jiao Song
,
Dianjun Wang
Journal of Combinatorial Theory Series B
107
, 2014, pp. 12-25
Extremal results on average subtree density of series-reduced trees
John Haslegrave
Journal of Combinatorial Theory Series B
107
, 2014, pp. 26-41
A base exchange property for regular matroids
Sean McGuinness
Journal of Combinatorial Theory Series B
107
, 2014, pp. 42-77
Matroids with an infinite circuit-cocircuit intersection
Nathan Bowler
,
Johannes Carmesin
Journal of Combinatorial Theory Series B
107
, 2014, pp. 78-91
The stable set polytope of claw-free graphs with stability number at least four. I. Fuzzy antihat graphs are
\mathcal W
-perfect
A. Galluccio
,
C. Gentile
,
P. Ventura
Journal of Combinatorial Theory Series B
107
, 2014, pp. 92-122
Regular graphs with maximal energy per vertex
Edwin R. van Dam
,
Willem H. Haemers
,
Jack H. Koolen
Journal of Combinatorial Theory Series B
107
, 2014, pp. 123-131
Seiten 1
2
>