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 YEAR=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Uniform mixed hypergraphs: The possible numbers of colors
Csilla Bujtás
,
Zsolt Tuza
Graphs and Combinatorics
24
(1), 2008, pp. 1-12
On a spanning tree with specified leaves
Yoshimi Egawa
,
Haruhide Matsuda
,
Tomoki Yamashita
,
Kiyoshi Yoshimoto
Graphs and Combinatorics
24
(1), 2008, pp. 13-18
On planar graphs arbitrarily decomposable into closed trails
Mirko Horn̑ák
,
Zuzana Kocková
Graphs and Combinatorics
24
(1), 2008, pp. 19-28
Some notes on signed edge domination in graphs
H. Karami
,
S.M. Sheikholeslami
,
A. Khodkar
Graphs and Combinatorics
24
(1), 2008, pp. 29-35
Domination in graphs of minimum degree at least two and large girth
Christian Löwenstein
,
Dieter Rautenbach
Graphs and Combinatorics
24
(1), 2008, pp. 37-46
Hamilton cycle rich 2-factorizations of complete multipartite graphs
L. McCauley
,
C.A. Rodger
Graphs and Combinatorics
24
(1), 2008, pp. 47-52
The Ramsey numbers of large cycles versus odd wheels
Surahmat Surahmat
,
E.T. Baskoro
,
Ioan Tomescu
Graphs and Combinatorics
24
(1), 2008, pp. 53-58
Almost given length cycles in digraphs
Raphael Yuster
Graphs and Combinatorics
24
(1), 2008, pp. 59-65
A note on the game chromatic index of graphs
Tomasz Bartnicki
,
Jarosƚaw Grytczuk
Graphs and Combinatorics
24
(2), 2008, pp. 67-70
A 2-factor with short cycles passing through specified independent vertices in graph
Jiuying Dong
Graphs and Combinatorics
24
(2), 2008, pp. 71-80
Equitable partitions of flat association schemes
Mitsugu Hirasaka
,
Hanguk Kang
,
Kijung Kim
Graphs and Combinatorics
24
(2), 2008, pp. 81-89
Total colorings of planar graphs without small cycles
Jianfeng Hou
,
Yan Zhu
,
Guizhen Liu
,
Jianliang Wu
,
Mei Lan
Graphs and Combinatorics
24
(2), 2008, pp. 91-100
Relations between the circumference and
e
-circumference of a matroid
Manoel Lemos
Graphs and Combinatorics
24
(2), 2008, pp. 101-105
Path-factors in the square of a tree
Xiaojuan Li
,
Zhao Zhang
Graphs and Combinatorics
24
(2), 2008, pp. 107-111
A note on the structure of Turán densities of hypergraphs
Yuejian Peng
Graphs and Combinatorics
24
(2), 2008, pp. 113-125
Addendum to ``Bicolored matchings in some classes of graphs''
M.C. Costa
,
D. de Werra
,
C. Picouleau
,
B. Ries
Graphs and Combinatorics
24
(2), 2008, pp. 127-128
Sparse graphs which decompose into closed trails of arbitrary lengths
Elizabeth J. Billington
,
Nicholas J. Cavenagh
Graphs and Combinatorics
24
(3), 2008, pp. 129-147
The fine intersection problem for Steiner triple systems
Yeow Meng Chee
,
Alan C.H. Ling
,
Hao Shen
Graphs and Combinatorics
24
(3), 2008, pp. 149-157
Gauss-Bonnet formula, finiteness condition, and characterizations of graphs embedded in surfaces
Beifang Chen
,
Guantao Chen
Graphs and Combinatorics
24
(3), 2008, pp. 159-183
Error correcting sequence and projective de Bruijn graph
Mariko Hagita
,
Makoto Matsumoto
,
Fumio Natsu
,
Yuki Ohtsuka
Graphs and Combinatorics
24
(3), 2008, pp. 185-194
On group connectivity of graphs
Hong-Jian Lai
,
Rui Xu
,
Ju Zhou
Graphs and Combinatorics
24
(3), 2008, pp. 195-203
On the Ramsey number of sparse 3-graphs
Brendan Nagle
,
Sayaka Olsen
,
Vojtȇch Rödl
,
Mathias Schacht
Graphs and Combinatorics
24
(3), 2008, pp. 205-228
On automorphisms of some
d
-dimensional dual hyperovals in
PG(d(d+3)/2,2)
Hiroaki Taniguchi
Graphs and Combinatorics
24
(3), 2008, pp. 229-236
Monochromatic and heterochromatic subgraphs in edge-colored graphs - A survey
Mikio Kano
,
Xueliang Li
Graphs and Combinatorics
24
(4), 2008, pp. 237-263
On 2-detour subgraphs of the hypercube
József Balogh
,
Alexandr Kostochka
Graphs and Combinatorics
24
(4), 2008, pp. 265-272
Seiten 1
2
3
>