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=32
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Counting labelled three-connected and homeomorphically irreducible two-connected graphs
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 1-11
Counting unlabelled three-connected and homeomorphically irreducible two-connected graphs
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 12-32
Counting nonisomorphic three-connected planar maps
T.R.S. Walsh
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 33-44
Quasigroups defining Eulerian paths in complete graphs
Anton Kotzig
,
Jean M. Turgeon
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 45-56
Interval mapping graphs and periodic points of continuous functions
Uhland Burkart
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 57-68
A characterization of 3-connected graphs containing a given graph
Seiya Negami
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 69-74
On the enumeration of chains in regular chain-groups
D.K. Arrowsmith
,
F. Jaeger
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 75-89
Generalized
k
-tuple colorings of cycles and other graphs
R.C. Brigham
,
R.D. Dutton
Journal of Combinatorial Theory Series B
32
(1), 1982, February, pp. 90-94
Extending an extension of Grinberg's theorem
Joseph Zaks
Journal of Combinatorial Theory Series B
32
, 1982, pp. 95-98
On
n
-Skein isomorphisms of graphs
R.L. Hemminger
,
H.A. Jung
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 103-111
Alpha-balanced graphs and matrices and
GF(3)
-representability of matroids
K. Truemper
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 112-139
Cycles in bipartite tournaments
Lowell W. Beineke
,
Charles H.C. Little
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 140-145
Constructing graphs with pairs of pseudo-similar vertices
C.D. Godsil
,
W.L. Kocay
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 146-155
On distance-regularity in graphs
Paul M. Weichsel
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 156-161
Graphs with certain families of spanning trees
P. Erdŏs
,
R.J. Faudree
,
C.C. Rousseau
,
R.H. Schelp
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 162-170
Graph-encoded maps
Sóstenes Lins
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 171-181
The diameter of bipartite distance-regular graphs
Paul Terwilliger
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 182-188
Vector transversals
D.R. Woodall
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 189-205
Relative lengths of paths and cycles in
k
-connected graphs
S.C. Locke
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 206-222
Hamiltonian cycles in particular
k
-partite graphs
Jacqueline Ayel
Journal of Combinatorial Theory Series B
32
(2), 1982, April, pp. 223-228
Longest cycles in
r
-regular
r
-connected graphs
Brad Jackson
,
T.D. Parsons
Journal of Combinatorial Theory Series B
32
, 1982, pp. 231-245
Extremals of functions on graphs with applications to graphs and hypergraphs
Vera T. Sós
,
E.G. Straus
Journal of Combinatorial Theory Series B
32
, 1982, pp. 246-257
Simpler counterexamples to the edge-reconstruction conjecture for infinite graphs
Thomas Andreae
Journal of Combinatorial Theory Series B
32
, 1982, pp. 258-263
Graphs having circuits with at least two chords
Heinz-Jürgen Voss
Journal of Combinatorial Theory Series B
32
, 1982, pp. 264-285
Ordered colourings of graphs
E.J. Cockayne
,
A.G. Thomason
Journal of Combinatorial Theory Series B
32
, 1982, pp. 286-292
Seiten 1
2
>