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=51
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cycle and circle tests of balance in gain graphs: Forbidden minors and their groups
Konstantin Rybnikov
,
Thomas Zaslavsky
Journal of Graph Theory
51
(1), 2006, pp. 1-21
Ramsey unsaturated and saturated graphs
P. Balister
,
J. Lehel
,
R.H. Schelp
Journal of Graph Theory
51
(1), 2006, pp. 22-32
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-Rödl function
Claude Tardif
,
David Wehlau
Journal of Graph Theory
51
(1), 2006, pp. 33-36
Moments of graphs in monotone families
Zoltán Füredi
,
André Kündgen
Journal of Graph Theory
51
(1), 2006, pp. 37-48
Edge-disjoint Hamiltonian cycles in hypertournaments
Vojislav Petrovic
,
Carsten Thomassen
Journal of Graph Theory
51
(1), 2006, pp. 49-52
New upper bounds on the decomposability of planar graphs
Fedor V. Fomin
,
Dimitrios M. Thilikos
Journal of Graph Theory
51
(1), 2006, pp. 53-81
Decompositions of a complete multidigraph into Nonhamiltonian paths
Mariusz Meszka
,
Zdzisƚaw Skupień
Journal of Graph Theory
51
(1), 2006, pp. 82-91
(d,1)
-total labeling of graphs with a given maximum average degree
Mickaël Montassier
,
André Raspaud
Journal of Graph Theory
51
(2), 2006, pp. 93-109
Graph relations, clique divergence and surface triangulations
F. Larrión
,
V. Neumann-Lara
,
M.A. Pizaña
Journal of Graph Theory
51
(2), 2006, pp. 110-122
Spanning subgraphs of graphs partitioned into two isomorphic pieces
Anthony Bonato
Journal of Graph Theory
51
(2), 2006, pp. 123-136
Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
Rostislav Caha
,
V. Koubek
Journal of Graph Theory
51
(2), 2006, pp. 137-169
A note on the cover degeneracy of graphs
Li Zhang
,
Baoyindureng Wu
Journal of Graph Theory
51
(2), 2006, pp. 170-173
Infinite paths in planar graphs III, 1-way infinite paths
Xingxing Yu
Journal of Graph Theory
51
(3), 2006, pp. 175-198
The chromatic covering number of a graph
Reza Naserasr
,
Claude Tardif
Journal of Graph Theory
51
(3), 2006, pp. 199-204
Average degree and contractibility
Matthias Kriesell
Journal of Graph Theory
51
(3), 2006, pp. 205-224
On totally multicolored stars
Juan José Montellano-Ballesteros
Journal of Graph Theory
51
(3), 2006, pp. 225-243
On two Turán numbers
Jian Shen
Journal of Graph Theory
51
(3), 2006, pp. 244-250
On the number of colorings of a snark minus an edge
Richard C. Bradley
Journal of Graph Theory
51
(3), 2006, pp. 251-259
N
-flips in even triangulations on the sphere
Atsuhiro Nakamoto
,
Tadashi Sakuma
,
Yusuke Suzuki
Journal of Graph Theory
51
(3), 2006, pp. 260-268
Matchings in hypergraphs of large minimum degree
Daniela Kühn
,
Deryk Osthus
Journal of Graph Theory
51
(4), 2006, pp. 269-280
On the acyclic choosability of graphs
Mickaël Montassier
,
Pascal Ochem
,
André Raspaud
Journal of Graph Theory
51
(4), 2006, pp. 281-300
On fans in multigraphs
David Cariolaro
Journal of Graph Theory
51
(4), 2006, pp. 301-318
The last excluded case of Dirac's map-color theorem for choosability
Daniel Král'
,
Riste S̆krekovski
Journal of Graph Theory
51
(4), 2006, pp. 319-354