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=75
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The existence of exactly
m
-coloured complete subgraphs
Alan Stacey
,
Peter Weidl
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 1-18
On extremal connectivity properties of unavoidable matroids
Zhaoyang Wu
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 19-45
Constructing 4-valent
\frac{1}{2}
-transistive graphs with a nonsolvable automorphism group
Aleksander Malnic̑
,
Dragan Marus̑ic̑
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 46-55
On the intersections of systems of curves
Gelasio Salazar
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 56-60
Highly connected sets and the excluded grid theorem
Reinhard Diestel
,
Tommy R. Jensen
,
Konstantin Yu. Gorbunov
,
Carsten Thomassen
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 61-73
The number of removable edges in 3-connected graphs
Su Jianji
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 74-87
On the circumferences of regular 2-connected graphs
Bing Wei
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 88-99
Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
Carsten Thomassen
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 100-109
On the number of acute triangles in a straight-line embedding of a maximal planar graph
Atsushi Kaneko
,
Hiroshi Maehara
,
Mamoru Watanabe
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 110-115
A pattern of asymptotic vertex valency distributions in planar maps
Valery A. Liskovets
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 116-133
A description of claw-free perfect graphs
Frédéric Maffray
,
Bruce A. Reed
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 134-156
A short proof of a theorem concerning degree sums and connectivity on Hamiltonian graphs
Bing Wei
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 157-159
Turán's theorem and maximal degrees
Béla Bollobás
Journal of Combinatorial Theory Series B
75
(1), 1999, pp. 160-164
9-connected claw-free graphs are Hamilton-connected
Stephan Brandt
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 167-173
R(C_n, C_n, C_n)\le(4+o(1))n
Tomasz Łuczak
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 174-187
Tetravalent graphs admitting half-transitive group actions: Alternating cycles
Dragan Marus̑ic̑
,
Cheryl E. Praeger
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 188-205
Some formulas for spin models on distance-regular graphs
Brian Curtin
,
Kazumasa Nomura
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 206-236
Finding minimum generators of path systems
András Frank
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 237-244
The game coloring number of planar graphs
Xuding Zhu
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 245-258
Distance graphs and
T
-coloring
Gerard J. Chang
,
Daphne D.-F. Liu
,
Xuding Zhu
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 259-269
Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings
Xiao Zhou
,
Takao Nishizeki
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 270-287
On the vertex-distinguishing proper edge-colorings of graphs
Cristina Bazgan
,
Amel Harkat-Benhamdine
,
Hao Li
,
Mariusz Woźniak
Journal of Combinatorial Theory Series B
75
(2), 1999, pp. 288-301