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=28
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
k
-domination and
k
-independence in graphs: A survey
Mustapha Chellali
,
Odile Favaron
,
Adriana Hansberg
,
Lutz Volkmann
Graphs and Combinatorics
28
(1), 2012, pp. 1-55
How many conjectures can you stand? A survey
H.J. Broersma
,
Z. Ryjác̑ek
,
P. Vrána
Graphs and Combinatorics
28
(1), 2012, pp. 57-75
Convex sets in lexicographic products of graphs
Bijo S. Anand
,
Manoj Changat
,
Sandi Klavz̑ar
,
Iztok Peterin
Graphs and Combinatorics
28
(1), 2012, pp. 77-84
Outerplanar thrackles
Grant Cairns
,
Yury Nikolayevsky
Graphs and Combinatorics
28
(1), 2012, pp. 85-96
Dominator colorings in some classes of graphs
Mustapha Chellali
,
Frédéric Maffray
Graphs and Combinatorics
28
(1), 2012, pp. 97-107
Covering complete hypergraphs with cuts of minimum total size
Sebastian M. Cioabȃ
,
André Kündgen
Graphs and Combinatorics
28
(1), 2012, pp. 109-122
Connected domination number of a graph and its complement
H. Karami
,
S.M. Sheikholeslami
,
Abdollah Khodkar
,
Douglas B. West
Graphs and Combinatorics
28
(1), 2012, pp. 123-131
Counting orientable embeddings by genus for a type of 3-regular graph
Jianchu Zeng
,
Yanpei Liu
,
Rongxia Hao
Graphs and Combinatorics
28
(1), 2012, pp. 133-142
Super connectivity and super edge connectivity of the Mycielskian of a graph
Litao Guo
,
Ruifang Liu
,
Xiaofeng Guo
Graphs and Combinatorics
28
(2), 2012, pp. 143-147
Degree sequences and the existence of
k
-factors
D. Bauer
,
H.J. Broersma
,
J. van den Heuvel
,
N. Kahl
,
E. Schmeichel
Graphs and Combinatorics
28
(2), 2012, pp. 149-166
Trees with given stability number and minimum number of stable sets
Véronique Bruy`ere
,
Gwenaël Joret
,
Hadrien Mélot
Graphs and Combinatorics
28
(2), 2012, pp. 167-187
Uniquely
C_4
-saturated graphs
Joshua Cooper
,
John Lenz
,
Timothy D. LeSaulnier
,
Paul S. Wenger
,
Douglas B. West
Graphs and Combinatorics
28
(2), 2012, pp. 189-197
Girth and total domination in graphs
Michael A. Henning
,
Anders Yeo
Graphs and Combinatorics
28
(2), 2012, pp. 199-214
Acyclic edge coloring of planar graphs without small cycles
Jianfeng Hou
,
Guizhen Liu
,
Jianliang Wu
Graphs and Combinatorics
28
(2), 2012, pp. 215-226
The generalized
\tau
-bases of primitive non-powerful signed digraphs with d loops
Yufei Huang
,
Bolian Liu
,
Siyuan Chen
Graphs and Combinatorics
28
(2), 2012, pp. 227-242
Critical independent sets and König-Egerváry graphs
Vadim E. Levit
,
Eugen Mandrescu
Graphs and Combinatorics
28
(2), 2012, pp. 243-250
Upper bounds for the rainbow connection numbers of line graphs
Xueliang Li
,
Yuefang Sun
Graphs and Combinatorics
28
(2), 2012, pp. 251-263
On the maximum number of cycles in outerplanar and series-parallel graphs
Anna de Mier
,
Marc Noy
Graphs and Combinatorics
28
(2), 2012, pp. 265-275
Spanning cyclic subdivisions of vertex-disjoint cycles and chorded cycles in graphs
Shengning Qiao
,
Shenggui Zhang
Graphs and Combinatorics
28
(2), 2012, pp. 277-285
On super restricted edge connectivity of half vertex transitive graphs
Yingzhi Tian
,
Jixiang Meng
,
Xiaodong Liang
Graphs and Combinatorics
28
(2), 2012, pp. 287-296
Super-simple twofold Steiner pentagon systems
R.J.R. Abel
,
F.E. Bennett
Graphs and Combinatorics
28
(3), 2012, pp. 297-308
Exponentially many monochromatic
n
-matchings in
K_{3n-1}
Ni Cao
,
Han Ren
Graphs and Combinatorics
28
(3), 2012, pp. 309-314
A characterization of graphs where the independence number equals the radius
Ermelinda DeLaViña
,
Craig E. Larson
,
Ryan Pepper
,
Bill Waller
Graphs and Combinatorics
28
(3), 2012, pp. 315-332
On the convexity number of graphs
Mitre C. Dourado
,
Fábio Protti
,
Dieter Rautenbach
,
Jayme L. Szwarcfiter
Graphs and Combinatorics
28
(3), 2012, pp. 333-345
Finding a sun in building-free graphs
Elaine M. Eschen
,
Chính T. Hoàng
,
Jeremy P. Spinrad
,
R. Sritharan
Graphs and Combinatorics
28
(3), 2012, pp. 347-364
Seiten 1
2
3
>