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
[1]
Hilfe
Suche: Journal=Graphs and Combinatorics AND YEAR=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Ascending subgraph decompositions of tournaments of order
6n+3
Brian C. Wagner
Graphs and Combinatorics
29
(6), 2013, pp. 1951-1959
The signed
k
-submatchings in graphs
Changping Wang
Graphs and Combinatorics
29
(6), 2013, pp. 1961-1971
On edge cut of graphs leaving components of order at least five
Jichang Wu
,
Jianping Ou
Graphs and Combinatorics
29
(6), 2013, pp. 1973-1981
Two equivalent properties of
\mathcal Z_3
-connectivity
Rui Xu
Graphs and Combinatorics
29
(6), 2013, pp. 1983-1987
The algebraic connectivity of graphs with given matching number
Bao-Xuan Zhu
Graphs and Combinatorics
29
(6), 2013, pp. 1989-1995
Seiten
<
1
2
3
4
5
6
7