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=2004
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex colouring and forbidden subgraphs - A survey
Bert Randerath
,
Ingo Schiermeyer
Graphs and Combinatorics
20
(1), 2004, pp. 1-40
Existence of 1-rotational
k
-cycle systems of the complete graph
Marco Buratti
Graphs and Combinatorics
20
(1), 2004, pp. 41-46
Bipartite
Q
-polynomial distance-regular graphs
John S. Caughman IV
Graphs and Combinatorics
20
(1), 2004, pp. 47-57
Note on the Pfaffian matrix-tree theorem
Scott Hirschman
,
Victor Reiner
Graphs and Combinatorics
20
(1), 2004, pp. 59-63
Sparse
H
-colourable graphs of bounded maximum degree
Hossein Hajiabolhassan
,
Xuding Zhu
Graphs and Combinatorics
20
(1), 2004, pp. 65-71
Infinite series of triangulations on closed surfaces with vertex covers of given degree
Tetsuji Katahira
Graphs and Combinatorics
20
(1), 2004, pp. 73-78
On the chromatic number of the square of the Kneser graph
K(2k+1, k)
Seog-Jin Kim
,
Kittikorn Nakprasit
Graphs and Combinatorics
20
(1), 2004, pp. 79-90
Pancyclicity of strong products of graphs
Daniel Král
,
Jana Maxová
,
Pavel Podbrdský
,
Robert S̑ámal
Graphs and Combinatorics
20
(1), 2004, pp. 91-104
On graphs determined by their Tutte polynomials
Anna de Mier
,
Marc Noy
Graphs and Combinatorics
20
(1), 2004, pp. 105-119
Maximum induced linear forests in outerplanar graphs
Michael J. Pelsmajer
Graphs and Combinatorics
20
(1), 2004, pp. 121-129
Chromatic polynomials and the symmetric group
Philippe Pitteloud
Graphs and Combinatorics
20
(1), 2004, pp. 131-144
A problem on hinged dissections with colours
J. Akiyama
,
F. Hurtado
,
C. Merino
,
J. Urrutia
Graphs and Combinatorics
20
(2), 2004, pp. 145-159
Configurations in 4-cycle systems
Darryn Bryant
,
Mike Grannell
,
Terry Griggs
,
Martin Mac̑aj
Graphs and Combinatorics
20
(2), 2004, pp. 161-179
The toughness of a toroidal graph with connectivity 3 and girth 6 is exactly 1
Weiting Cao
,
Michael J. Pelsmajer
Graphs and Combinatorics
20
(2), 2004, pp. 181-183
Extendable cycles in multipartite tournaments
Yubao Guo
,
Lutz Volkmann
Graphs and Combinatorics
20
(2), 2004, pp. 185-190
On the achromatic index of
K_{q^2+q}
or a prime
q
Mirko Horn̑ák
,
S̑tefan Pc̑ola
,
Mariusz Woźniak
Graphs and Combinatorics
20
(2), 2004, pp. 191-203
Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
Jesper Jansson
,
Takeshi Tokuyama
Graphs and Combinatorics
20
(2), 2004, pp. 205-222
A note on convex decompositions of a set of points in the plane
Víctor Neumann-Lara
,
Eduardo Rivera-Campo
,
Jorge Urrutia
Graphs and Combinatorics
20
(2), 2004, pp. 223-231
The 3-connected graphs with exactly three non-essential edges
James Oxley
,
Haidong Wu
Graphs and Combinatorics
20
(2), 2004, pp. 233-246
An improved bound for the crossing number of
C_m \times C_n
: A self-contained proof using mostly combinatorial arguments
Gelasio Salazar
,
Edgardo Ugalde
Graphs and Combinatorics
20
(2), 2004, pp. 247-253
Bipartite subgraphs and quasi-randomness
Jozef Skokan
,
Lubos Thoma
Graphs and Combinatorics
20
(2), 2004, pp. 255-262
On Steiner versions of (bi)connectivity in network problems
A. Volgenant
,
C.W. Duin
Graphs and Combinatorics
20
(2), 2004, pp. 263-273
Disjoint triangles of a cubic line graph
Xiao-Dong Zhang
,
Stanislaw Bylka
Graphs and Combinatorics
20
(2), 2004, pp. 275-280
A characterization of domination reducible graphs
Igor Ed. Zverovich
Graphs and Combinatorics
20
(2), 2004, pp. 281-289
Generalizing pancyclic and
k
-ordered graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
20
(3), 2004, pp. 291-309
Seiten 1
2
>