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=53
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Berge trigraphs
Maria Chudnovsky
Journal of Graph Theory
53
(1), 2006, pp. 1-55
Color critical hypergraphs with many edges
V. Rödl
,
M. Siggers
Journal of Graph Theory
53
(1), 2006, pp. 56-74
Covering the edges of a graph by three odd subgraphs
Tamás Mátrai
Journal of Graph Theory
53
(1), 2006, pp. 75-82
Hamiltonian graphs involving neighborhood unions
Guantao Chen
,
Warren E. Shreve
,
Bing Wei
Journal of Graph Theory
53
(2), 2006, pp. 83-100
The generalized acyclic edge chromatic number of random regular graphs
Stefanie Gerke
,
Catherine Greenhill
,
Nicholas Wormald
Journal of Graph Theory
53
(2), 2006, pp. 101-125
Mean Ramsey-Turán numbers
Raphael Yuster
Journal of Graph Theory
53
(2), 2006, pp. 126-134
Distinguishing geometric graphs
Michael O. Albertson
,
Debra L. Boutin
Journal of Graph Theory
53
(2), 2006, pp. 135-150
Nearly light cycles in embedded graphs and crossing-critical graphs
Mario Lomelí
,
Gelasio Salazar
Journal of Graph Theory
53
(2), 2006, pp. 151-156
On arc-traceable tournaments
Arthur H. Busch
,
Michael S. Jacobson
,
K.B. Reid
Journal of Graph Theory
53
(2), 2006, pp. 157-166
Vertex partitions of chordal graphs
David R. Wood
Journal of Graph Theory
53
(2), 2006, pp. 167-172
Infinite paths in planar graphs IV, dividing cycles
Xingxing Yu
Journal of Graph Theory
53
(3), 2006, pp. 173-195
A Ramsey-type result for the hypercube
Noga Alon
,
Rados̑ Radoic̑ić
,
Benny Sudakov
,
Jan Vondrák
Journal of Graph Theory
53
(3), 2006, pp. 196-208
Transversal hypergraphs to perfect matchings in bipartite graphs: Characterization and generation algorithms
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
Journal of Graph Theory
53
(3), 2006, pp. 209-232
Clique-coloring some classes of odd-hole-free graphs
David Défossez
Journal of Graph Theory
53
(3), 2006, pp. 233-249
Distinguishing Cartesian powers of graphs
Wilfried Imrich
,
Sandi Klavz̑ar
Journal of Graph Theory
53
(3), 2006, pp. 250-260
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese Postman Problem for a planar triangulation
Carsten Thomassen
Journal of Graph Theory
53
(4), 2006, pp. 261-269
Maximal independent sets in graphs with at most
r
cycles
Goh Chee Ying
,
Koh Khee Meng
,
Bruce E. Sagan
,
Vincent R. Vatter
Journal of Graph Theory
53
(4), 2006, pp. 270-282
Maximal and maximum independent sets in graphs with at most
r
cycles
Bruce E. Sagan
,
Vincent R. Vatter
Journal of Graph Theory
53
(4), 2006, pp. 283-314
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegree
S. Bessy
,
F. Havet
,
E. Birmelé
Journal of Graph Theory
53
(4), 2006, pp. 315-332
Characterization of edge-colored complete graphs with properly colored Hamilton paths
Jinfeng Feng
,
Hans-Erik Giesen
,
Yubao Guo
,
Gregory Gutin
,
Tommy Jensen
,
Arash Rafiey
Journal of Graph Theory
53
(4), 2006, pp. 333-346