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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some counterexamples associated with the three-color problem
V.A. Aksionov
,
L.S. Mel'nikov
Journal of Combinatorial Theory Series B
28
(1), 1980, February, pp. 1-9
Embeddings of covering projections of graphs
F.W. Clarke
,
A.D. Thomas
,
D.A. Waller
Journal of Combinatorial Theory Series B
28
(1), 1980, February, pp. 10-17
Symmetries of directed graphs and the Chinese remainder theorem
Stephane Foldes
Journal of Combinatorial Theory Series B
28
(1), 1980, February, pp. 18-25
Geometries on partially ordered sets
Ulrich Faigle
Journal of Combinatorial Theory Series B
28
, 1980, pp. 26-51
Limits of chromatic zeros of some families of maps
S. Beraha
,
J. Kahane
,
N.J. Weiss
Journal of Combinatorial Theory Series B
28
, 1980, pp. 52-65
f
-factors and related decompositions of graphs
J.E. Graver
,
W.B. Jurkat
Journal of Combinatorial Theory Series B
28
(1), 1980, February, pp. 66-84
Further results on the Aanderaa-Rosenberg conjecture
D.J. Kleitman
,
D.J. Kwiatkowski
Journal of Combinatorial Theory Series B
28
, 1980, pp. 85-95
A note on cospectral graphs
Charles R. Johnson
Journal of Combinatorial Theory Series B
28
, 1980, pp. 96-103
On the enumeration of convex polyhedra
W.T. Tutte
Journal of Combinatorial Theory Series B
28
, 1980, pp. 105-126
Some properties of irreducible coverings by cliques of complete multipartite graphs
Ioan Tomescu
Journal of Combinatorial Theory Series B
28
, 1980, pp. 127-141
Hamiltonian-connected tournaments
Carsten Thomassen
Journal of Combinatorial Theory Series B
28
(2), 1980, April, pp. 142-163
Simple hypergraphs with maximal number of adjacent pairs of edges
Rudolf Ahlswede
Journal of Combinatorial Theory Series B
28
, 1980, pp. 164-167
6-transitive graphs
Peter J. Cameron
Journal of Combinatorial Theory Series B
28
, 1980, pp. 168-179
Minimal separating sets of maximum size
Y. Alavi
,
M. Behzad
,
E.A. Nordhaus
Journal of Combinatorial Theory Series B
28
, 1980, pp. 180-183
Classification and enumeration of minimum
(d,3,3)
-graphs for odd
d
Victor Klee
Journal of Combinatorial Theory Series B
28
, 1980, pp. 184-207
Matroid matching and some applications
L. Lovász
Journal of Combinatorial Theory Series B
28
(2), 1980, April, pp. 208-236
Packing and covering with matroid circuits
P.D. Seymour
Journal of Combinatorial Theory Series B
28
, 1980, pp. 237-242
Path number of bipartite digraphs
William G. Frye
,
Renu Laskar
Journal of Combinatorial Theory Series B
28
, 1980, pp. 243-244
A note on Hamiltonian split graphs
Rainer E. Burkard
,
Peter L. Hammer
Journal of Combinatorial Theory Series B
28
, 1980, pp. 245-248
On Hartfiel and Maxson's definition of connected sets of a matroid
James G. Oxley
Journal of Combinatorial Theory Series B
28
, 1980, pp. 249-250
On the orientation of graphs
András Frank
Journal of Combinatorial Theory Series B
28
(3), 1980, January, pp. 251-261
On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks
P.J. Owens
Journal of Combinatorial Theory Series B
28
(3), 1980, January, pp. 262-277
Endomorphism monoids and topological subgraphs of graphs
László Babai
,
Ales̑ Pultr
Journal of Combinatorial Theory Series B
28
(3), 1980, January, pp. 278-283
On maximal independent sets of vertices in claw-free graphs
George J. Minty
Journal of Combinatorial Theory Series B
28
(3), 1980, January, pp. 284-304
Decomposition of regular matroids
P.D. Seymour
Journal of Combinatorial Theory Series B
28
(3), 1980, January, pp. 305-359