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=26
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rainbow generalizations of Ramsey theory: A survey
Shinya Fujita
,
Colton Magnant
,
Kenta Ozeki
Graphs and Combinatorics
26
(1), 2010, pp. 1-30
Tricyclic Steiner triple systems
Rebecca C. Calahan
,
Robert B. Gardner
,
Quan D. Tran
Graphs and Combinatorics
26
(1), 2010, pp. 31-42
Paired-domination in subdivided star-free graphs
Paul Dorbec
,
Sylvain Gravier
Graphs and Combinatorics
26
(1), 2010, pp. 43-49
Some combinatorics related to central binomial coefficients: Grand-Dyck paths, coloured noncrossing partitions and signed pattern avoiding permutations
Luca Ferrari
Graphs and Combinatorics
26
(1), 2010, pp. 51-70
Long monochromatic Berge cycles in colored 4-uniform hypergraphs
András Gyárfás
,
Gábor N. Sárközy
,
Endre Szemerédi
Graphs and Combinatorics
26
(1), 2010, pp. 71-76
Bounds on the total restrained domination number of a graph
J.H. Hattingh
,
E. Jonck
,
E.J. Joubert
Graphs and Combinatorics
26
(1), 2010, pp. 77-93
Bipartite divisor graphs for integer subsets
Mohammad A. Iranmanesh
,
Cheryl E. Praeger
Graphs and Combinatorics
26
(1), 2010, pp. 95-105
The b-chromatic number of cubic graphs
Marko Jakovac
,
Sandi Klavz̑ar
Graphs and Combinatorics
26
(1), 2010, pp. 107-118
The 3-connected graphs with exactly
k
non-essential edges
Yuxing Liu
Graphs and Combinatorics
26
(1), 2010, pp. 119-131
Decomposing complete equipartite graphs into closed trails of length
k
Benjamin R. Smith
Graphs and Combinatorics
26
(1), 2010, pp. 133-140
An infinite family of planar non-Hamiltonian bihomogeneously traceable oriented graphs
Carol T. Zamfirescu
Graphs and Combinatorics
26
(1), 2010, pp. 141-146
Delsarte set graphs with small
c_{2}
S. Bang
,
A. Hiraki
,
J.H. Koolen
Graphs and Combinatorics
26
(2), 2010, pp. 147-162
On the index of necklaces
Francesco Belardo
,
Enzo M. Li Marzi
,
Slobodan K. Simić
,
Jianfeng Wang
Graphs and Combinatorics
26
(2), 2010, pp. 163-172
On a sharp degree sum condition for disjoint chorded cycles in graphs
Shuya Chiba
,
Shinya Fujita
,
Yunshu Gao
,
Guojun Li
Graphs and Combinatorics
26
(2), 2010, pp. 173-186
A
k
-tree containing specified vertices
Shuya Chiba
,
Ryota Matsubara
,
Kenta Ozeki
,
Masao Tsugaki
Graphs and Combinatorics
26
(2), 2010, pp. 187-205
Edge-disjoint open trails in complete bipartite multigraphs
Sylwia Cichacz
,
Agnieszka Görlich
Graphs and Combinatorics
26
(2), 2010, pp. 207-214
Cycle lengths in Hamiltonian graphs with a pair of vertices having large degree sum
Michael Ferrara
,
Michael S. Jacobson
,
Angela Harris
Graphs and Combinatorics
26
(2), 2010, pp. 215-223
Pan-
H
-linked graphs
Michael Ferrara
,
Colton Magnant
,
Jeffrey Powell
Graphs and Combinatorics
26
(2), 2010, pp. 225-242
Induced graph packing problems
Zoltán Király
,
Jácint Szabó
Graphs and Combinatorics
26
(2), 2010, pp. 243-257
On minimal defining sets of full designs and self-complementary designs, and a new algorithm for finding defining sets of
t
-designs
Emre Kolotoğlu
,
Emine Şule Yazıcı
Graphs and Combinatorics
26
(2), 2010, pp. 259-281
An anti-Ramsey theorem on diamonds
J.J. Montellano-Ballesteros
Graphs and Combinatorics
26
(2), 2010, pp. 283-291
Integer functions on the cycle space and edges of a graph
Daniel C. Slilaty
Graphs and Combinatorics
26
(2), 2010, pp. 293-299
A min-max property of chordal bipartite graphs with applications
Atif Abueida
,
Arthur H. Busch
,
R. Sritharan
Graphs and Combinatorics
26
(3), 2010, pp. 301-313
A characterization of
3-(\gamma_c, 2)
-critical claw-free graphs which are not
3-\gamma_c
-critical
Watcharaphong Ananchuen
,
Nawarat Ananchuen
,
Louis Caccetta
Graphs and Combinatorics
26
(3), 2010, pp. 315-328
Splitter theorems for 4-regular graphs
Guoli Ding
,
Jinko Kanno
Graphs and Combinatorics
26
(3), 2010, pp. 329-344
Seiten 1
2
3
>