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=16
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Les partages d'un polygone convexe en 4 polygones semblables au premier
G. Valette
,
T. Zamfirescu
Journal of Combinatorial Theory Series B
16
, 1974, pp. 1-16
On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs
Herbert Fleischner
Journal of Combinatorial Theory Series B
16
, 1974, pp. 17-28
The square of every two-connected graph is Hamiltonian
Herbert Fleischner
Journal of Combinatorial Theory Series B
16
, 1974, pp. 29-34
1-factors of point determining graphs
David P. Sumner
Journal of Combinatorial Theory Series B
16
, 1974, pp. 35-41
Wheels within wheels
Donald E. Knuth
Journal of Combinatorial Theory Series B
16
, 1974, pp. 42-46
The intersection graphs of subtrees in trees are exactly the chordal graphs
Fȃnicȃ Gavril
Journal of Combinatorial Theory Series B
16
, 1974, pp. 47-56
Disjoint factors of diameter two in complete graphs
Juraj Bosák
Journal of Combinatorial Theory Series B
16
, 1974, pp. 57-63
Patroids
Cedric A.B. Smith
Journal of Combinatorial Theory Series B
16
, 1974, pp. 64-76
Inequalities for the chromatic numbers of graphs
K Schürger
Journal of Combinatorial Theory Series B
16
, 1974, pp. 77-85
Graph puzzles, homotopy, and the alternating group
Richard M. Wilson
Journal of Combinatorial Theory Series B
16
, 1974, pp. 86-96
Cycles of even length in graphs
J.A. Bondy
,
M. Simonovits
Journal of Combinatorial Theory Series B
16
, 1974, pp. 97-105
Self-complementary graphs
Richard A. Gibbs
Journal of Combinatorial Theory Series B
16
, 1974, pp. 106-123
Construction of quartic graphs
S. Toida
Journal of Combinatorial Theory Series B
16
, 1974, pp. 124-133
A census of simple planar triangulations
P.N. Rathie
Journal of Combinatorial Theory Series B
16
, 1974, pp. 134-138
Bounding the diameter of a distance-transitive graph
D.H. Smith
Journal of Combinatorial Theory Series B
16
, 1974, pp. 139-144
Color-critical graphs and hypergraphs
B. Toft
Journal of Combinatorial Theory Series B
16
, 1974, pp. 145-161
The strongest monotone degree condition for
n
-connectedness of a graph
F.T. Boesch
Journal of Combinatorial Theory Series B
16
, 1974, pp. 162-165
Solution d'un problème de Erdŏs-Lovász
M. Deza
Journal of Combinatorial Theory Series B
16
, 1974, pp. 166-167
Codichromatic graphs
W.T. Tutte
Journal of Combinatorial Theory Series B
16
, 1974, pp. 168-174
Sufficient conditions for a graph to be Hamiltonian
S. Goodman
,
S. Hedetniemi
Journal of Combinatorial Theory Series B
16
, 1974, pp. 175-180
Une relation de séparation entre cocircuits d'un matroide
Jean Claude Fournier
Journal of Combinatorial Theory Series B
16
, 1974, pp. 181-190
On a property of the class of
n
-colorable graphs
D. Seinsche
Journal of Combinatorial Theory Series B
16
, 1974, pp. 191-193
A note on tree isomorphisms
A.R. Bednarek
Journal of Combinatorial Theory Series B
16
, 1974, pp. 194-196
A certain polynomial of a graph and graphs with an extremal number of trees
A.K. Kel'mans
,
V.M. Chelnokov
Journal of Combinatorial Theory Series B
16
, 1974, pp. 197-214
The reconstruction of outerplanar graphs
William B. Giles
Journal of Combinatorial Theory Series B
16
, 1974, pp. 215-226
Seiten 1
2
>