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=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Circular edge-colorings of cubic graphs with girth six
Daniel Král'
,
Edita Mác̑ajová
,
Ján Mazák
,
Jean-Sébastien Sereni
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 351-358
The vertex primitive and vertex bi-primitive
s
-arc regular graphs
Cai Heng Li
,
Liang Niu
,
Ákos Seress
,
Ronald Solomon
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 359-366
Hamiltonian degree sequences in digraphs
Daniela Kühn
,
Deryk Osthus
,
Andrew Treglown
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 367-380
Smallest counterexample to the 5-flow conjecture has girth at least eleven
Martin Kochol
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 381-389
On the isoperimetric spectrum of graphs and its approximations
Amir Daneshgar
,
Hossein Hajiabolhassan
,
Ramin Javadi
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 390-412
Crossing-critical graphs with large maximum degree
Zdenȇk Dvoȓák
,
Bojan Mohar
Journal of Combinatorial Theory Series B
100
(4), 2010, pp. 413-417
Cycle covers (I) - Minimal contra pairs and Hamilton weights
Cun-Quan Zhang
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 419-438
Some constructive bounds on Ramsey numbers
Alexandr Kostochka
,
Pavel Pudlák
,
Vojtech Rödl
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 439-445
Irreducible triangulations are small
Gwenaël Joret
,
David R. Wood
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 446-455
Pancyclicity of Hamiltonian and highly connected graphs
Peter Keevash
,
Benny Sudakov
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 456-467
Growth constants of minor-closed classes of graphs
Olivier Bernardi
,
Marc Noy
,
Dominic Welsh
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 468-484
On the half-plane property and the Tutte group of a matroid
Petter Brändén
,
Rafael S. González D'León
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 485-492
On Mighton's characterization of graphic matroids
Donald K. Wagner
Journal of Combinatorial Theory Series B
100
(5), 2010, pp. 493-496
On the vertex-stabiliser in arc-transitive digraphs
Primoz̑ Potoc̑nik
,
Gabriel Verret
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 497-509
Confinement of matroid representations to subsets of partial fields
R.A. Pendavingh
,
S.H.M. van Zwam
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 510-545
Packing Steiner trees on four terminals
Matthias Kriesell
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 546-553
Graphs with bounded tree-width and large odd-girth are almost bipartite
Alexandr V. Kostochka
,
Daniel Král'
,
Jean-Sébastien Sereni
,
Michael Stiebitz
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 554-559
Claw-free graphs VI. Colouring
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 560-572
On distance-regular graphs with smallest eigenvalue at least
-m
J.H. Koolen
,
S. Bang
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 573-584
Lattice path matroids: The excluded minors
Joseph E. Bonin
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 585-599
Independent paths and
K_5
-subdivisions
Jie Ma
,
Xingxing Yu
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 600-616
Convolution-multiplication identities for Tutte polynomials of graphs and matroids
Joseph P.S. Kung
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 617-624
The number of points in a matroid with no
n
-point line as a minor
Jim Geelen
,
Peter Nelson
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 625-630
On several partitioning problems of Bollobás and Scott
Jie Ma
,
Pei-Lan Yen
,
Xingxing Yu
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 631-649
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
Naonori Kakimura
Journal of Combinatorial Theory Series B
100
(6), 2010, pp. 650-670
Seiten
<
1
2
3
>