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=Graphs and Combinatorics AND Volume=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Properties of edge-tough graphs
Gyula Y. Katona
Graphs and Combinatorics
15
(3), 1999, pp. 315-325
Natural isomorphism classes of cycle permutation graphs over a graph
Hye Kyung Kim
,
Jin Hwan Kim
,
Daekeun Lim
Graphs and Combinatorics
15
(3), 1999, pp. 327-336
A bound for the lengths of arcs in Steiner systems
Ryuzaburo Noda
Graphs and Combinatorics
15
(3), 1999, pp. 337-340
On the fractional intersection number of a graph
Edward R. Scheinermann
,
Ann N. Trenk
Graphs and Combinatorics
15
(3), 1999, pp. 341-351
On vertex-disjoint complete bipartite subgraphs in a bipartite graph
Hong Wang
Graphs and Combinatorics
15
(3), 1999, pp. 353-364
A new result on Alspach's problem
Guiying Yan
Graphs and Combinatorics
15
(3), 1999, pp. 365-371
Cycles through 23 vertices in 3-connected cubic planar graphs
R.E.L. Aldred
,
S. Bau
,
D.A. Holton
,
Brendan D. McKay
Graphs and Combinatorics
15
(4), 1999, pp. 373-376
Bipartite distance-regular graphs, Part II
Brian Curtin
Graphs and Combinatorics
15
(4), 1999, pp. 377-391
Hamiltonicity of amalgams
Arthur M. Farley Farley
,
Andrzej Proskurowski
,
Mirosƚaw Skowronńska
,
Maciej M. Sysƚo
Graphs and Combinatorics
15
(4), 1999, pp. 393-404
On the spectrum of Steiner
(v,k,t)
trades (II)
Brenton D. Gray
,
Colin Ramsay
Graphs and Combinatorics
15
(4), 1999, pp. 405-415
Distance-regular graphs of the height
h
Akira Hiraki
Graphs and Combinatorics
15
(4), 1999, pp. 417-428
Contractible non-edges in triangle-free graphs
Matthias Kriesell
Graphs and Combinatorics
15
(4), 1999, pp. 429-439
On maximum sized
k
-regular matroids
Charles Semple
Graphs and Combinatorics
15
(4), 1999, pp. 441-462
(3,k)
-factor-critical graphs
Minẏong Shi
,
Xudong Yuan
,
Mao-cheng Cai
,
Odile Favaron
Graphs and Combinatorics
15
(4), 1999, pp. 463-471
Non-bicritical critical snarks
Eckhard Steffen
Graphs and Combinatorics
15
(4), 1999, pp. 473-480
How close to regular must a semicomplete multipartite digraph be to secure Hamiltonicity?
Anders Yeo
Graphs and Combinatorics
15
(4), 1999, pp. 481-493
Seiten
<
1
2