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=22
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Toughness in graphs - A survey
Douglas Bauer
,
Hajo Broersma
,
Edward Schmeichel
Graphs and Combinatorics
22
(1), 2006, pp. 1-35
Pushing squares around
Adrian Dumitrescu
,
János Pach
Graphs and Combinatorics
22
(1), 2006, pp. 37-50
On the pancyclicity of lexicographic products
Tomás̑ Kaiser
,
Matthias Kriesell
Graphs and Combinatorics
22
(1), 2006, pp. 51-58
On resolvable multipartite G-designs II
M.G. Karunambigai
,
A. Muthusamy
Graphs and Combinatorics
22
(1), 2006, pp. 59-67
Weight distribution of the bases of a matroid
Manoel Lemos
Graphs and Combinatorics
22
(1), 2006, pp. 69-82
The semi-arc automorphism group of a graph with application to map enumeration
Linfan Mao
,
Yanpei Liu
,
Erling Wei
Graphs and Combinatorics
22
(1), 2006, pp. 83-101
Extremal problems for imbalanced edges
Dieter Rautenbach
,
Ingo Schiermeyer
Graphs and Combinatorics
22
(1), 2006, pp. 103-111
Large induced forests in triangle-free planar graphs
Mohammad R. Salavatipour
Graphs and Combinatorics
22
(1), 2006, pp. 113-126
Domination in graphs of minimum degree five
Hua-Ming Xing
,
Liang Sun
,
Xue-Gang Chen
Graphs and Combinatorics
22
(1), 2006, pp. 127-143
An extremal problem on contractible edges in 3-connected graphs
Joe Anderson
,
Haidong Wu
Graphs and Combinatorics
22
(2), 2006, pp. 145-152
New local conditions for a graph to be Hamiltonian
Armen S. Asratian
Graphs and Combinatorics
22
(2), 2006, pp. 153-160
Directed path-width and monotonicity in digraph searching
János Barát
Graphs and Combinatorics
22
(2), 2006, pp. 161-172
Sum list coloring graphs
Adam Berliner
,
Ulrike Bostelmann
,
Richard A. Brualdi
,
Louis Deaett
Graphs and Combinatorics
22
(2), 2006, pp. 173-183
Planar graphs, via well-orderly maps and trees
Nicolas Bonichon
,
Cyril Gavoille
,
Nicolas Hanusse
,
Dominique Poulalhon
,
Gilles Schaeffer
Graphs and Combinatorics
22
(2), 2006, pp. 185-202
Distance-
j
j-ovoids in regular near
2d
-gons
Bart De Bruyn
Graphs and Combinatorics
22
(2), 2006, pp. 203-216
On
H
-linked graphs
Michael Ferrara
,
Ronald Gould
,
Gerard Tansey
,
Thor Whalen
Graphs and Combinatorics
22
(2), 2006, pp. 217-224
The maximum size of 3-wise intersecting and 3-wise union families
Peter Frankl
,
Norihide Tokushige
Graphs and Combinatorics
22
(2), 2006, pp. 225-231
A note on a packing problem in transitive tournaments
Agnieszka Görlich
,
Monika Pilśniak
,
Mariusz Woźniak
Graphs and Combinatorics
22
(2), 2006, pp. 233-239
On
n
-partite tournaments with unique
n
-cycle
Gregory Gutin
,
Arash Rafiey
,
Anders Yeo
Graphs and Combinatorics
22
(2), 2006, pp. 241-249
Partition of triples of order
6k+5
into
6k+3
optimal packings and one packing of size
8k+4
Lijun Ji
Graphs and Combinatorics
22
(2), 2006, pp. 251-260
A necessary and sufficient condition for the existence of a heterochromatic spanning tree in a graph
Kazuhiro Suzuki
Graphs and Combinatorics
22
(2), 2006, pp. 261-269
On the circumference of 3-connected quasi-claw-free graphs
Elkin Vumar
Graphs and Combinatorics
22
(2), 2006, pp. 271-282
New lower bounds on the multicolor Ramsey numbers
R_r(C_{2m})
Sun Yongqi
,
Yang Yuansheng
,
Xu Feng
,
Li Bingxi
Graphs and Combinatorics
22
(2), 2006, pp. 283-288
Coloring vertices and faces of locally planar graphs
Michael O. Albertson
,
Bojan Mohar
Graphs and Combinatorics
22
(3), 2006, pp. 289-295
Sub-Ramsey numbers for arithmetic progressions
Maria Axenovich
,
Ryan Martin
Graphs and Combinatorics
22
(3), 2006, pp. 297-309
Seiten 1
2
>