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: Author="Locke, S.C."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
11/30 (Finding large independent sets in connected triangle-free 3-regular graphs
K. Fraughnaugh
,
S.C. Locke
Journal of Combinatorial Theory Series B
65
(1), 1995, pp. 51-72
Triangle-free subgraphs of powers of cycles
J.A. Bondy
,
S.C. Locke
Graphs and Combinatorics
8
, 1992, pp. 109-118
Cycles and paths through specified vertices in
k
-connected graphs
Y. Egawa
,
R. Glas
,
S.C. Locke
Journal of Combinatorial Theory Series B
52
, 1991, pp. 20-29
Cycles through three vertices in 2-connected graphs
S.C. Locke
,
Cun-Quan Zhang
Graphs and Combinatorics
7
, 1991, pp. 265-269
A note on bipartite subgraphs of triangle-free regular graphs
S.C. Locke
Journal of Graph Theory
14
(2), 1990, pp. 181-185
Largest bipartite subgraphs in triangle-free graphs with maximum degree three
J.A. Bondy
,
S.C. Locke
Journal of Graph Theory
10
(4), 1986, pp. 477-504
A generalization of Dirac's theorem
S.C. Locke
Combinatorica
5
, 1985, pp. 149-159
Maximum
k
-colorable subgraphs
S.C. Locke
Journal of Graph Theory
6
(2), 1982, pp. 123-132
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