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 YEAR=2010
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
Oleg V. Borodin
,
Aleksei N. Glebov
Journal of Graph Theory
66
(1), 2011, pp. 1-31
On hitting all maximum cliques with an independent set
Landon Rabern
Journal of Graph Theory
66
(1), 2011, pp. 32-37
Facial non-repetitive edge-coloring of plane graphs
Frédéric Havet
,
Stanislav Jendrol'
,
Roman Soták
,
Erika S̑krabul'áková
Journal of Graph Theory
66
(1), 2011, pp. 38-48
On vertex partitions and some minor-monotone graph parameters
D. Gonçalves
Journal of Graph Theory
66
(1), 2011, pp. 49-56
Monochromatic cycle partitions of edge-colored graphs
Gábor N. Sárközy
Journal of Graph Theory
66
(1), 2011, pp. 57-64
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Gábor Simonyi
,
Gábor Tardos
Journal of Graph Theory
66
(1), 2011, pp. 65-82
Choosability of toroidal graphs without short cycles
Leizhen Cai
,
Weifan Wang
,
Xuding Zhu
Journal of Graph Theory
65
(1), 2010, pp. 1-15
List multicoloring problems involving the
k
-fold Hall numbers
Mathew Cropper
,
Anthony J.W. Hilton
,
Peter D., Jr. Johnson
,
Jenö Lehel
Journal of Graph Theory
65
(1), 2010, pp. 16-34
Continuous
k
-to-1 functions between complete graphs whose orders are of a different parity
John Baptist Gauci
,
Anthony J.W. Hilton
Journal of Graph Theory
65
(1), 2010, pp. 35-60
Connectivity keeping paths in
k
-connected graphs
W. Mader
Journal of Graph Theory
65
(1), 2010, pp. 61-69
An application of the combinatorial Nullstellensatz to a graph labelling problem
Dan Hefetz
,
Annina Saluz
,
Huong T.T. Tran
Journal of Graph Theory
65
(1), 2010, pp. 70-82
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most
k
O.V. Borodin
,
A.O. Ivanova
,
M. Montassier
,
P. Ochem
,
A. Raspaud
Journal of Graph Theory
65
(2), 2010, pp. 83-93
Achromatic number of fragmentable graphs
Keith Edwards
Journal of Graph Theory
65
(2), 2010, pp. 94-114
Vizing's coloring algorithm and the fan number
Diego Scheide
,
Michael Stiebitz
Journal of Graph Theory
65
(2), 2010, pp. 115-138
Infinite families of crossing-critical graphs with prescribed average degree and crossing number
Drago Bokal
Journal of Graph Theory
65
(2), 2010, pp. 139-162
Claw-free circular-perfect graphs
Arnaud Pêcher
,
Xuding Zhu
Journal of Graph Theory
65
(2), 2010, pp. 163-172
The independence number condition for the existence of a spanning
f
-tree
Hikoe Enomoto
,
Kenta Ozeki
Journal of Graph Theory
65
(3), 2010, pp. 173-184
Connectivity of random regular graphs generated by the pegging algorithm
Pu Gao
Journal of Graph Theory
65
(3), 2010, pp. 185-197
Stars and bonds in crossing-critical graphs
Petr Hlinȇný
,
Gelasio Salazar
Journal of Graph Theory
65
(3), 2010, pp. 198-215
Classification of edge-transitive rose window graphs
István Kovács
,
Klavdija Kutnar
,
Dragan Marus̑ic̑
Journal of Graph Theory
65
(3), 2010, pp. 216-231
A class of symmetric graphs with 2-arc transitive quotients
Bin Jia
,
Zai Ping Lu
,
Gai Xia Wang
Journal of Graph Theory
65
(3), 2010, pp. 232-245
Cycles of even lengths modulo
k
Ajit A. Diwan
Journal of Graph Theory
65
(3), 2010, pp. 246-252
Homomorphism-homogeneous graphs
Momchil Rusinov
,
Pascal Schweitzer
Journal of Graph Theory
65
(3), 2010, pp. 253-262
A note on the bichromatic numbers of graphs
Dennis D.A. Epple
,
Jing Huang
Journal of Graph Theory
65
(4), 2010, pp. 263-269
Cycle and cocycle coverings of graphs
Sean McGuinness
Journal of Graph Theory
65
(4), 2010, pp. 270-284
Seiten 1
2
3
4
>