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.
On the existence of elementary Abelian cycle systems
Anna Benini
,
Anita Pasotti
Graphs and Combinatorics
25
(1), 2009, pp. 1-14
Perpendicular rectangular Latin arrays
Robert Brier
,
Darryn Bryant
Graphs and Combinatorics
25
(1), 2009, pp. 15-25
The interchange graphs of tournaments with minimum score vectors are exactly hypercubes
An-Hang Chen
,
Jou-Ming Chang
,
Yue-Li Wang
Graphs and Combinatorics
25
(1), 2009, pp. 27-34
Multigraphs with
\Delta \ge 3
are totally-
(2\Delta -1)
-choosable
Daniel W. Cranston
Graphs and Combinatorics
25
(1), 2009, pp. 35-40
A new bound on the total domination subdivision number
O. Favaron
,
H. Karami
,
R. Khoeilar
,
S.M. Sheikholeslami
Graphs and Combinatorics
25
(1), 2009, pp. 41-47
Further 6-sparse Steiner triple systems
A.D. Forbes
,
M.J. Grannell
,
T.S. Griggs
Graphs and Combinatorics
25
(1), 2009, pp. 49-64
Distance-regular graph with
c_{2} >1
and
\alpha_{1} =0<a_{2}
Akira Hiraki
Graphs and Combinatorics
25
(1), 2009, pp. 65-79
Transitive, locally finite median graphs with finite blocks
Wilfried Imrich
,
Sandi Klavz̑ar
Graphs and Combinatorics
25
(1), 2009, pp. 81-90
Bounding the size of equimatchable graphs of fixed genus
Ken-ichi Kawarabayashi
,
Michael D. Plummer
Graphs and Combinatorics
25
(1), 2009, pp. 91-99
A comment on Ryser's conjecture for intersecting hypergraphs
Toufik Mansour
,
Chunwei Song
,
Raphael Yuster
Graphs and Combinatorics
25
(1), 2009, pp. 101-109
On the nullity of bipartite graphs
G.R. Omidi
Graphs and Combinatorics
25
(1), 2009, pp. 111-114
Frankl's conjecture and the dual covering property
R.S. Shewale
,
Vinayak Joshi
,
V.S. Kharat
Graphs and Combinatorics
25
(1), 2009, pp. 115-121
List point arboricity of dense graphs
Lingyan Zhen
,
Baoyindureng Wu
Graphs and Combinatorics
25
(1), 2009, pp. 123-128
Dirac's type sufficient conditions for Hamiltonicity and pancyclicity
Ahmed Ainouche
Graphs and Combinatorics
25
(2), 2009, pp. 129-137
On characterizations of rigid graphs in the plane using spanning trees - On characterizations of rigid graphs in the plane
Sergey Bereg
Graphs and Combinatorics
25
(2), 2009, pp. 139-144
On the chromaticity of multi-bridge hypergraphs
S.A. Bokhary
,
Ioan Tomescu
,
Akhlaq Ahmad Bhatti
Graphs and Combinatorics
25
(2), 2009, pp. 145-152
On the b-coloring of cographs and
P_{4}
-sparse graphs
Flavia Bonomo
,
Guillermo Durán
,
Frederic Maffray
,
Javier Marenco
,
Mario Valencia-Pabon
Graphs and Combinatorics
25
(2), 2009, pp. 153-167
On the cubicity of interval graphs
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Graphs and Combinatorics
25
(2), 2009, pp. 169-179
Total domination in partitioned graphs
Allan Frendrup
,
Preben Dahl Vestergaard
,
Anders Yeo
Graphs and Combinatorics
25
(2), 2009, pp. 181-196
Thickness-two graphs part two: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs
Ellen Gethner
,
Thom Sulanke
Graphs and Combinatorics
25
(2), 2009, pp. 197-217
Sparsity-certifying graph decompositions
Ileana Streinu
,
Louis Theran
Graphs and Combinatorics
25
(2), 2009, pp. 219-238
An asymptotic independence theorem for the number of matchings in graphs
Elmar Teufl
,
Stephan Wagner
Graphs and Combinatorics
25
(2), 2009, pp. 239-251
Upper embeddability, girth and the degree-sum of nonadjacent vertices
Ouyang Zhangdong
,
Wang Jing
,
Huang Yuanqiu
Graphs and Combinatorics
25
(2), 2009, pp. 253-264
The basis digraphs of
p
-schemes
A. Rahnamai Barghi
,
Ilia Ponomarenko
Graphs and Combinatorics
25
(3), 2009, pp. 265-271
Invariants of composite networks arising as a tensor product
Y. Diao
,
G. Hetyei
,
K. Hinson
Graphs and Combinatorics
25
(3), 2009, pp. 273-290
Seiten 1
2
3
>