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=69
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The rank facets of the stable set polytope for claw-free graphs
A. Galluccio
,
A. Sassano
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 1-38
Convex programming and cirumference of 3-connected graphs of lowe genus
Zhicheng Gao
,
Xingxing Yu
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 39-51
The genus problem for cubic graphs
Carsten Thomassen
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 52-58
Matroid valuation on independent sets
Kazuo Murota
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 59-78
Five-connected toroidal graphs are Hamiltonian
Robin Thomas
,
Xingxing Yu
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 79-96
Bridged graphs are cop-win graphs: An algorithmic proof
Victor Chepoi
Journal of Combinatorial Theory Series B
69
(1), 1997, pp. 97-100
A bound on the strong chromatic index of a graph
Michael Molloy
,
Bruce Reed
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 103-109
Extensions of flow theorems
Genghua Fan
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 110-124
Diagonal transformations in quadrangulations and Dehn twists preserving cycle parities
Atsuhiro Nakamoto
,
Katsuhiro Ota
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 125-141
Geodetic rays and fibers in one-ended planar graphs
Peter Niemeyer
,
Mark E. Watkins
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 142-163
Edge decomposition into isomorphic copies of
sK_{1,2}
is polynomial
Zbigniew Lonc
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 164-182
On the convexified Sauer-Shelah teorem
Stanislaw J. Szarek
,
Michel Talagrand
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 183-192
Subgraph counting identities and Ramsey numbers
Brendan D. McKay
,
Stanisƚaw P. Radziszowski
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 193-209
Partitioning complete bipartite graphs by monochromatic cycles
P.E. Haxell
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 210-218
Simultaneously colouring the edges and faces of plane graphs
Adrian O. Waller
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 219-221
A note on alternating cycles in edge-coloured graphs
Anders Yeo
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 222-225
A note on the generalized Petersen graphs that are also Caylay graphs
Marko Lovrec̑ic̑ Saraz̑in
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 226-229
The structure of well-covered graphs and the complexity of their recognition problems
David Tankus
,
Michael Tarsi
Journal of Combinatorial Theory Series B
69
(2), 1997, pp. 230-233