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=J. Graph Theory AND Volume=61
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Circle graph obstructions under pivoting
Jim Geelen
,
Sang-il Oum
Journal of Graph Theory
61
(1), 2009, pp. 1-11
Multipartite Ramsey numbers for odd cycles
András Gyárfás
,
Gábor N. Sárközy
,
Richard H. Schelp
Journal of Graph Theory
61
(1), 2009, pp. 12-21
Highly connected monochromatic subgraphs of multicolored graphs
Henry Liu
,
Robert Morris
,
Noah Prince
Journal of Graph Theory
61
(1), 2009, pp. 22-44
Fair reception and Vizing's conjecture
Bos̑tjan Bres̑ar
,
Douglas F. Rall
Journal of Graph Theory
61
(1), 2009, pp. 45-54
On set intersection representations of graphs
Stasys Jukna
Journal of Graph Theory
61
(1), 2009, pp. 55-75
The determining number of a Cartesian product
Debra L. Boutin
Journal of Graph Theory
61
(2), 2009, pp. 77-87
Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs
Armen S. Asratian
,
Carl Johan Casselgren
,
Jennifer Vandenbussche
,
Douglas B. West
Journal of Graph Theory
61
(2), 2009, pp. 88-97
Periods in missing lengths of rainbow cycles
Petr Vojtȇchovský
Journal of Graph Theory
61
(2), 2009, pp. 98-110
Minimum
C_5
-saturated graphs
Ya-Chen Chen
Journal of Graph Theory
61
(2), 2009, pp. 111-126
Equitable list coloring and treewidth
Michael J. Pelsmajer
Journal of Graph Theory
61
(2), 2009, pp. 127-139
Maximum directed cuts in digraphs with degree restriction
Jenö Lehel
,
Frédéric Maffray
,
Myriam Preissmann
Journal of Graph Theory
61
(2), 2009, pp. 140-156
On the chromatic number of a random 5-regular graph
J. Díaz
,
A.C. Kaporis
,
G.D. Kemkes
,
L.M. Kirousis
,
X. Pérez
,
N. Wormald
Journal of Graph Theory
61
(3), 2009, pp. 157-191
Acyclic edge coloring of graphs with maximum degree 4
Manu Basavaraju
,
L. Sunil Chandran
Journal of Graph Theory
61
(3), 2009, pp. 192-209
Anti-Ramsey numbers of doubly edge-critical graphs
Tao Jiang
,
Oleg Pikhurko
Journal of Graph Theory
61
(3), 2009, pp. 210-218
Generating 5-regular planar graphs
Guoli Ding
,
Jinko Kanno
,
Jianning Su
Journal of Graph Theory
61
(3), 2009, pp. 219-240
Circular choosability
Frédéric Havet
,
Ross J. Kang
,
Tobias Müller
,
Jean-Sébastien Sereni
Journal of Graph Theory
61
(4), 2009, pp. 241-270
On bipartite graphs of diameter 3 and defect 2
Charles Delorme
,
Leif K. Jrgensen
,
Mirka Miller
,
Guillermo Pineda-Villavicencio
Journal of Graph Theory
61
(4), 2009, pp. 271-288
Partial characterizations of circular-arc graphs
F. Bonomo
,
G. Durán
,
L.N. Grippo
,
M.D. Safe
Journal of Graph Theory
61
(4), 2009, pp. 289-306
Planar graphs without 4-cycles are acyclically 6-choosable
Weifan Wang
,
Min Chen
Journal of Graph Theory
61
(4), 2009, pp. 307-323
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments
Vladimir P. Korzhik
Journal of Graph Theory
61
(4), 2009, pp. 324-334