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=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Constrained Ramsey numbers of graphs
Robert E. Jamison
,
Tao Jiang
,
Alan C.H. Ling
Journal of Graph Theory
42
(1), 2003, pp. 1-16
Sparse pseudo-random graphs are Hamiltonian
Michael Krivelevich
,
Benny Sudakov
Journal of Graph Theory
42
(1), 2003, pp. 17-33
Classification of certain subgraphs of the 3-dimensional grid
Jan Kristian Haugland
Journal of Graph Theory
42
(1), 2003, pp. 34-60
Bi-arc graphs and the complexity of list homomorphisms
Tomas Feder
,
Pavol Hell
,
Jing Huang
Journal of Graph Theory
42
(1), 2003, pp. 61-80
Estimates of coefficients of chromatic polynomials and numbers of cliques of
(c,n,m)
-graphs
Philippe Pitteloud
Journal of Graph Theory
42
(2), 2003, pp. 81-94
Vertex-distinguishing edge colorings of graphs
P.N. Balister
,
O.M. Riordan
,
R.H. Schelp
Journal of Graph Theory
42
(2), 2003, pp. 95-109
Coloring the square of a planar graph
Jan van den Heuvel
,
Sean McGuinness
Journal of Graph Theory
42
(2), 2003, pp. 110-124
3-colorability of 4-regular Hamiltonian graphs
Herbert Fleischner
,
Gert Sabidussi
Journal of Graph Theory
42
(2), 2003, pp. 125-140
Graham's pebbling conjecture on products of cycles
David S. Herscovici
Journal of Graph Theory
42
(2), 2003, pp. 141-154
On removable cycles through every edge
Manoel Lemos
,
James Oxley
Journal of Graph Theory
42
(2), 2003, pp. 155-164
Structure theorem for tournaments omitting
N_5
Brenda J. Latka
Journal of Graph Theory
42
(3), 2003, pp. 165-192
Coloring with three-colored subgraphs
Dhruv Mubayi
Journal of Graph Theory
42
(3), 2003, pp. 193-198
Degree conditions for
k
-ordered Hamiltonian graphs
Ralph J. Faudree
,
Ronald J. Gould
,
Alexandr V. Kostochka
,
Linda Lesniak
,
Ingo Schiermeyer
,
Akira Saito
Journal of Graph Theory
42
(3), 2003, pp. 199-210
Nowhere-zero 3-flows in locally connected graphs
Hong-Jian Lai
Journal of Graph Theory
42
(3), 2003, pp. 211-219
Size Ramsey numbers of stars versus 4-chromatic graphs
Oleg Pikhurko
Journal of Graph Theory
42
(3), 2003, pp. 220-233
Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number
Lutz Volkmann
Journal of Graph Theory
42
(3), 2003, pp. 234-245
Edge list multicoloring trees: An extension of Hall's theorem
Mathew Cropper
,
András Gyárfás
,
Jenö Lehel
Journal of Graph Theory
42
(3), 2003, pp. 246-255
Planar embeddings with infinite faces
C. Paul Bonnington
,
Mark E. Watkins
Journal of Graph Theory
42
(4), 2003, pp. 257-275
Vertex-disjoint cycles containing prescribed vertices
Yoshiyasu Ishigami
,
Tao Jiang
Journal of Graph Theory
42
(4), 2003, pp. 276-296
Small degree out-branchings
Jrgen Bang-Jensen
,
Stéphan Thomassé
,
Anders Yeo
Journal of Graph Theory
42
(4), 2003, pp. 297-307
Eulerian subgraphs in 3-edge-connected graphs and Hamiltonian line graphs
Zhi-Hong Chen
,
Hong-Jian Lai
,
Xiangwen Li
,
Deying Li
,
Jinzhong Mao
Journal of Graph Theory
42
(4), 2003, pp. 308-319
An algebraic characterization of projective-planar graphs
Lowell Abrams
,
Daniel C. Slilaty
Journal of Graph Theory
42
(4), 2003, pp. 320-331
Crossing numbers of sequences of graphs II: Planar tiles
Benny Pinontoan
,
R. Bruce Richter
Journal of Graph Theory
42
(4), 2003, pp. 332-341
Generating cycles in graphs with at most one end
Henning Bruhn
Journal of Graph Theory
42
(4), 2003, pp. 342-349
Two-arc closed subsets of graphs
Marston Conder
,
Margaret Morton
,
Cheryl E. Praeger
Journal of Graph Theory
42
(4), 2003, pp. 350-364