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=27
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Solution of the Hamiltonian problem for self-complementary graphs
Siddani Bhaskara Rao
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 13-41
Brooks' graph-coloring theorem and the independence number
Paul A. Catlin
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 42-48
Some perfect coloring properties of graphs
Claude A. Christen
,
Stanley M. Selkow
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 49-59
A self-dual language for graph theory
T.A. McKee
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 60-66
On metric properties of certain clique graphs
Edward Howorka
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 67-74
An introduction to matching polynomials
E.J. Farrell
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 75-86
On the combinatorial antipodal-point lemmas
Daniel I.A. Cohen
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 87-91
Self-dual embeddings of Cayley graphs
Saul Stahl
Journal of Combinatorial Theory Series B
27
(1), 1979, August, pp. 92-107
On the number of trees in a random forest
E.M. Palmer
,
A.J. Schwenk
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 109-121
On the eigenvalues and eigenvectors of certain finite, vertex-weighted, bipartite graphs
M.J. Rigby
,
R.B. Mallion
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 122-129
Triangulation à
V_5
séparés dans le problème des quatre couleurs
Kenneth Appel
,
Wolfgang Haken
,
Jean Mayer
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 130-150
The imbedding index of a graph
Jack E. Graver
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 151-159
Constructions of point-colour-symmetric graphs
C.C. Chen
,
H.H. Teh
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 160-167
There are four countable ultrahomogeneous graphs without triangles
Robert E. Woodrow
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 168-179
Spectra of Cayley graphs
László Babai
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 180-189
Partition relations for denumerable ordinals
Eva Nosal
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 190-197
Connectivity, genus, and the number of components in vertex-deleted subgraphs
Edward F. Schmeichel
,
Gary S. Bloom
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 198-201
über eine Eigenschaft lokalfiniter, unendlicher Bäume
T. Andreae
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 202-215
Constructing the free erection of a geometry
Hien Q. Nguyen
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 216-224
A short proof of the existence of highly chromatic hypergraphs without short cycles
Jaroslav Nes̑etȓil
,
Vojtȇch Rödl
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 225-227
A characterization of the graphs in which the transversal number equals the matching number
F. Sterboul
Journal of Combinatorial Theory Series B
27
(2), 1979, October, pp. 228-229
Note sur le problème de Ulam
Maurice Pouzet
Journal of Combinatorial Theory Series B
27
(3), 1979, December, pp. 231-236
Sur le problème de Goodman pour les quadrangles et la majoration des nombres de Ramsey
Guy Giraud
Journal of Combinatorial Theory Series B
27
(3), 1979, December, pp. 237-253
Critically partitionable graphs. I
A.G. Thomason
Journal of Combinatorial Theory Series B
27
(3), 1979, December, pp. 254-259
Infinite subgraphs as matroid circuits
Laurence R. Matthews
Journal of Combinatorial Theory Series B
27
(3), 1979, December, pp. 260-273
Seiten 1
2
>