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=10
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some
(1,-1)
matrices
Jennifer Wallis
Journal of Combinatorial Theory Series B
10
, 1971, pp. 1-11
Graphs with forbidden subgraphs
Gary Chartrand
,
Dennis Geller
,
Stephen Hedetniemi
Journal of Combinatorial Theory Series B
10
, 1971, pp. 12-41
A new subgraph expansion for obtaining coloring polynomials for graphs
J.F. Nagle
Journal of Combinatorial Theory Series B
10
, 1971, pp. 42-59
Matching problems
G. Katona
,
D. Szász
Journal of Combinatorial Theory Series B
10
, 1971, pp. 60-92
The circle numbers of orbital graphs
William L. Quirin
Journal of Combinatorial Theory Series B
10
, 1971, pp. 93-94
Generalized versions of Hall's theorem
D.J.A. Welsch
Journal of Combinatorial Theory Series B
10
, 1971, pp. 95-101
A characterization of clique graphs
Fred S. Roberts
,
Joel H. Spencer
Journal of Combinatorial Theory Series B
10
, 1971, pp. 102-108
A generalization of a theorem of Turán
N. Sauer
Journal of Combinatorial Theory Series B
10
, 1971, pp. 109-112
On Okada's method for realizing cut-set matrices
K.P. Rajappan
,
A.H. Stone
Journal of Combinatorial Theory Series B
10
, 1971, pp. 113-134
A context-free language and enumeration problems on infinite trees and digraphs
W. Kuich
Journal of Combinatorial Theory Series B
10
, 1971, pp. 135-142
Convexity in directed graphs
John L. Pfaltz
Journal of Combinatorial Theory Series B
10
, 1971, pp. 143-162
The trivalent symmetric graphs of girth at most six
Robert C. Miller
Journal of Combinatorial Theory Series B
10
, 1971, pp. 163-182
Perfect matchings of a graph
Ian Anderson
Journal of Combinatorial Theory Series B
10
, 1971, pp. 183-186
On the upper-bound conjecture for convex polytopes
P. McMullen
Journal of Combinatorial Theory Series B
10
, 1971, pp. 187-200
A problem on random trees
J.W. Moon
Journal of Combinatorial Theory Series B
10
, 1971, pp. 201-205
On some special squared rectangles
C.J. Bouwkamp
Journal of Combinatorial Theory Series B
10
, 1971, pp. 206-211
An upper bound for the rectilinear crossing number of the complete graph
H.F. Jensen
Journal of Combinatorial Theory Series B
10
, 1971, pp. 212-216
Linked-cluster expansion for the graph-vertex coloration problem
George A., Jr. Baker
Journal of Combinatorial Theory Series B
10
, 1971, pp. 217-231
On the number of hexagons in a map
Ernest Jucovic̑
Journal of Combinatorial Theory Series B
10
, 1971, pp. 232-236
Graphes fortement connexes
c
-minimaux et graphes sans circuit
co
-minimaux
Guy Chaty
Journal of Combinatorial Theory Series B
10
, 1971, pp. 237-244
On the impossibility of certain Moore graphs
Henry D. Friedman
Journal of Combinatorial Theory Series B
10
, 1971, pp. 245-252
On regular graphs I
D.Z̑. Djokovic̑
Journal of Combinatorial Theory Series B
10
, 1971, pp. 253-263
A characterization of a class of regular graphs
A. Ramachandra Rao
Journal of Combinatorial Theory Series B
10
, 1971, pp. 264-274
A market problem
D.R. Woodall
Journal of Combinatorial Theory Series B
10
, 1971, pp. 275-287
An algorithm for finding the essential sets of arcs of certain graphs
Pierre Robert
Journal of Combinatorial Theory Series B
10
, 1971, pp. 288-298
Seiten 1
2
>