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=99
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering planar graphs with forests, one having bounded maximum degree
D. Gonçalves
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 314-322
Judicious
k
-partitions of graphs
Baogang Xu
,
Xingxing Yu
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 324-337
Weighted enumeration of spanning subgraphs with degree constraints
David G. Wagner
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 347-357
Cayley sum graphs and eigenvalues of
(3,6)
-fullerenes
Matt DeVos
,
Luis Goddyn
,
Bojan Mohar
,
Robert S̑ámal
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 358-369
Even pairs in Berge graphs
Maria Chudnovsky
,
Paul Seymour
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 370-377
k
-CS-transitive infinite graphs
Robert Gray
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 378-398
On mod
(2p+1)
-orientations of graphs
Hong-Jian Lai
,
Yehong Shao
,
Hehui Wu
,
Ju Zhou
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 399-406
The Erdŏs-Pósa property for matroid circuits
Jim Geelen
,
Kasper Kabell
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 407-419
Growth rates of minor-closed classes of matroids
Jim Geelen
,
Joseph P.S. Kung
,
Geoff Whittle
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 420-427
A tight bound on the collection of edges in MSTs of induced subgraphs
Gregory B. Sorkin
,
Angelika Steger
,
Rico Zenklusen
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 428-435
Good characterizations for some degree constrained subgraphs
Jácint Szabó
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 436-446
Vertex transitive embeddings of complete graphs
Cai Heng Li
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 447-454
Regular maps and hypermaps of Euler characteristic -1 to -200
Marston D.E. Conder
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 455-459
Hereditary properties of hypergraphs
Ryan Dotson
,
Brendan Nagle
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 460-473
The chromatic polynomial and list colorings
Carsten Thomassen
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 474-479
Regular
t
-balanced Cayley maps on semi-dihedral groups
Ju-Mok Oh
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 480-493
Large induced trees in
K_r
-free graphs
Jacob Fox
,
Po-Shen Loh
,
Benny Sudakov
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 494-501
Graph invariants in the spin model
Alexander Schrijver
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 502-511
A polynomial-time algorithm to find a linkless embedding of a graph
Hein van der Holst
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 512-530
Lehman matrices
Gérard Cornuéjols
,
Bertrand Guenin
,
Levent Tunçel
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 531-556
Linear connectivity forces large complete bipartite minors
Thomas Böhme
,
Ken-ichi Kawarabayashi
,
John Maharry
,
Bojan Mohar
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 557-582
Graph minors. XXI. Graphs with unique linkages
Neil Robertson
,
Paul Seymour
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 583-616
Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
Sergei Chmutov
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 617-638
Set systems with union and intersection constraints
Dhruv Mubayi
,
Reshma Ramadurai
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 639-642
Two-regular subgraphs of hypergraphs
Dhruv Mubayi
,
Jacques Verstraëte
Journal of Combinatorial Theory Series B
99
(3), 2009, pp. 643-655
Seiten
<
1
2
3
>