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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An unavoidable set of configurations in planar triangulations
K. Appel
,
W. Haken
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 1-21
Relations non reconstructibles par leurs restrictions
Maurice Pouzet
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 22-34
Maximal Hamiltonian cycles in squares of graphs
Arthur M. Hobbs
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 35-49
Hamiltonian squares of cacti
Arthur M. Hobbs
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 50-65
Upper and lower bounds for graph-diameter problems with application to record allocation
D.S. Hirschberg
,
C.K. Wong
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 66-74
The minimum genus of a two-point universal graph
George B. Purdy
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 75-77
Matchings and transversals in hypergraphs, domination and independence in trees
E.J. Cockayne
,
S.T. Hedetniemi
,
P.J. Slater
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 78-80
Score vectors of tournaments
Chang M. Bang
,
Henry, Jr. Sharp
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 81-84
Words with prescribed adjacencies
Ki Hang Kim
,
Fred Roush
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 85-97
The validity of the strong perfect-graph conjecture for
(K_4-e)
-free graphs
K.R. Parthasarathy
,
G. Ravindra
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 98-100
Acyclic orientations of a graph and chromatic and independence numbers
R.W. Deming
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 101-110
On a general class of graph polynomials
E.J. Farrell
Journal of Combinatorial Theory Series B
26
(1), 1979, February, pp. 111-122
On a packing problem for infinite graphs and independence spaces
James G. Oxley
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 123-130
Index four orientable embeddings and case zero of the Heawood conjecture
David J. Pengelley
,
M. Jungerman
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 131-144
A smallest graph of girth 5 and valency 6
M. O'Keefe
,
Pak-Ken Wong
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 145-149
A threshold property for intersections in a finite set
Jean-Luc Paillet
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 150-153
The nonorientable genus of the symmetric quadripartite graph
M. Jungerman
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 154-158
Matroid representation over
GF(3)
P.D. Seymour
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 159-173
On Reid's characterization of the ternary matroids
Robert E. Bixby
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 174-204
Flows and generalized coloring theorems in graphs
F. Jaeger
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 205-216
How to determine the maximum genus of a graph
Huy Xuong Nguyen
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 217-225
Upper-embeddable graphs and related topics
Huy Xuong Nguyen
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 226-232
Tabloids
Serge Hocquenghem
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 233-250
Logic and invariant theory IV. Invariants and syzygies in combinatorial geometry
Walter Whiteley
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 251-267
Hajós' graph-coloring conjecture: Variations and counterexamples
Paul A. Catlin
Journal of Combinatorial Theory Series B
26
(2), 1979, April, pp. 268-274
Seiten 1
2
>