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=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Domino tiling congruence modulo 4
Bridget Eileen Tenner
Graphs and Combinatorics
25
(4), 2009, pp. 625-638
Some properties of chromatic coefficients of linear uniform hypergraphs
Ioan Tomescu
,
Syed Ahtsham ul Haq Bokhary
Graphs and Combinatorics
25
(4), 2009, pp. 639-646
Minimum difference representations of graphs
József Balogh
,
Noah Prince
Graphs and Combinatorics
25
(5), 2009, pp. 647-655
A note on totally free matroids
Rong Chen
,
Kai-Nan Xiang
Graphs and Combinatorics
25
(5), 2009, pp. 657-673
A characterization of cubic graphs with paired-domination number three-fifths their order
Wayne Goddard
,
Michael A. Henning
Graphs and Combinatorics
25
(5), 2009, pp. 675-692
Restrained domination in claw-free graphs with minimum degree at least two
Johannes H. Hattingh
,
Ernst J. Joubert
Graphs and Combinatorics
25
(5), 2009, pp. 693-706
A magnetic procedure for the stability number
Alain Hertz
,
Dominique de Werra
Graphs and Combinatorics
25
(5), 2009, pp. 707-716
Elementary graphs with respect to
f
-parity factors
Mikio Kano
,
Gyula Y. Katona
,
Jácint Szabó
Graphs and Combinatorics
25
(5), 2009, pp. 717-726
An upper bound for the total domination subdivision number of a graph
H. Karami
,
R. Khoeilar
,
S.M. Sheikholeslami
,
A. Khodkar
Graphs and Combinatorics
25
(5), 2009, pp. 727-733
Maximum packings and minimum coverings of
K_v
with octagons
Mingchao Li
,
Jingjing Huo
,
Zhichao Gao
Graphs and Combinatorics
25
(5), 2009, pp. 735-752
Diameter-preserving spanning trees in sparse weighted graphs
Yue Liu
,
Jing Huang
Graphs and Combinatorics
25
(5), 2009, pp. 753-758
On jumping densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
25
(5), 2009, pp. 759-766
Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures
R.J.R. Abel
,
F.F. Bennett
,
M. Grüttmüller
Graphs and Combinatorics
25
(6), 2009, pp. 767-788
Determining sets, resolving sets, and the exchange property
Debra L. Boutin
Graphs and Combinatorics
25
(6), 2009, pp. 789-806
Smallest set-transversals of
k
-partitions
Csilla Bujtás
,
Zsolt Tusa
Graphs and Combinatorics
25
(6), 2009, pp. 807-816
Packing and covering triangles in planar graphs
Qing Cui
,
Penny Haxell
,
Will Ma
Graphs and Combinatorics
25
(6), 2009, pp. 817-824
On defining sets of full designs with block size three
Diane Donovan
,
James Lefevre
,
Mary Waterhaouse
,
Emine Şule Yazıcı
Graphs and Combinatorics
25
(6), 2009, pp. 825-839
On integral graphs with few cycles
G.R. Omidi
Graphs and Combinatorics
25
(6), 2009, pp. 841-849
Matching properties in total domination vertex critical graphs
Haichao Wang
,
Liying Kang
,
Erfang Shan
Graphs and Combinatorics
25
(6), 2009, pp. 851-861
Set-coloring of edges and multigraph Ramsey numbers
Xiaodong Xu
,
Zehui Shao
,
Wenlong Su
,
Zhenchong Li
Graphs and Combinatorics
25
(6), 2009, pp. 863-870
Seiten
<
1
2
3