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=105
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting odd cycles in locally dense graphs
Christian Reiher
Journal of Combinatorial Theory Series B
105
, 2014, pp. 1-5
Triangle-free intersection graphs of line segments with large chromatic number
Arkadiusz Pawlik
,
Jakub Kozik
,
Tomasz Krawczyk
,
Michaƚ Lasoń
,
Piotr Micek
,
William T. Trotter
,
Bartosz Walczak
Journal of Combinatorial Theory Series B
105
, 2014, pp. 6-10
Extending the Gyárfás-Sumner conjecture
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
105
, 2014, pp. 11-16
Packing of rigid spanning subgraphs and spanning trees
Joseph Cheriyan
,
Olivier Durand de Gevigney
,
Zoltán Szigeti
Journal of Combinatorial Theory Series B
105
, 2014, pp. 17-25
Maxwell-independence: A new rank estimate for the 3-dimensional generic rigidity matroid
Cheng Jialong
,
Meera Sitharam
Journal of Combinatorial Theory Series B
105
, 2014, pp. 26-43
Rao's degree sequence conjecture
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
105
, 2014, pp. 44-92
On spanning tree packings of highly edge connected graphs
Florian Lehner
Journal of Combinatorial Theory Series B
105
, 2014, pp. 93-126