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=67
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The genus of Petersen powers
Bojan Mohar
,
Andrej Vodopivec
Journal of Graph Theory
67
(1), 2011, pp. 1-8
All minimum
C_5
-saturated graphs
Ya-Chen Chen
Journal of Graph Theory
67
(1), 2011, pp. 9-26
Equivalence of four descriptions of generalized line graphs
G.R. Vijayakumar
Journal of Graph Theory
67
(1), 2011, pp. 27-33
A note on
k
-shortest paths problem
Nick Gravin
,
Ning Chen
Journal of Graph Theory
67
(1), 2011, pp. 34-37
Proximity thresholds for matching extension in planar and projective planar triangulations
R.E.L. Aldred
,
Michael D. Plummer
Journal of Graph Theory
67
(1), 2011, pp. 38-46
Multicolor bipartite Ramsey number of
C_4
and large
K_{n, n}
Qizhong Lin
,
Yusheng Li
Journal of Graph Theory
67
(1), 2011, pp. 47-54
On planar Hypohamiltonian graphs
Gábor Wiener
,
Makoto Araya
Journal of Graph Theory
67
(1), 2011, pp. 55-68
Finding paths between 3-colorings
Luis Cereceda
,
Jan van den Heuvel
,
Matthew Johnson
Journal of Graph Theory
67
(1), 2011, pp. 69-82
List strong linear 2-arboricity of sparse graphs
Oleg V. Borodin
,
Anna O. Ivanova
Journal of Graph Theory
67
(2), 2011, pp. 83-90
Constrained Ramsey numbers for rainbow matching
Allan Siu Lun Lo
Journal of Graph Theory
67
(2), 2011, pp. 91-95
Independence, odd girth, and average degree
Christian Löwenstein
,
Anders Sune Pedersen
,
Dieter Rautenbach
,
Friedrich Regen
Journal of Graph Theory
67
(2), 2011, pp. 96-111
Upper bounds on the sum of powers of the degrees of a simple planar graph
Jochen Harant
,
Stanislav Jendrol
,
Tomás̑ Madaras
Journal of Graph Theory
67
(2), 2011, pp. 112-123
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors
Y.O. Hamidoune
,
A. Lladó
,
S.C. López
Journal of Graph Theory
67
(2), 2011, pp. 124-138
Compact topological minors in graphs
Tao Jiang
Journal of Graph Theory
67
(2), 2011, pp. 139-152
Combinatorial theorems about embedding trees on the real line
Amit Chakrabarti
,
Subhash Khot
Journal of Graph Theory
67
(2), 2011, pp. 153-168
Channel assignment on Cayley graphs
Patrick Bahls
Journal of Graph Theory
67
(3), 2011, pp. 169-177
Circular consecutive choosability of
k
-choosable graphs
, Daphne Liu
,
Serguei Norine
,
Zhishi Pan
,
Xuding Zhu
Journal of Graph Theory
67
(3), 2011, pp. 178-197
A characterization of partially dual graphs
Iain Moffatt
Journal of Graph Theory
67
(3), 2011, pp. 198-217
Primitivity and independent sets in direct products of vertex-transitive graphs
Huajun Zhang
Journal of Graph Theory
67
(3), 2011, pp. 218-225
On a generalization of Rubin's theorem
Dmitry A. Shabanov
Journal of Graph Theory
67
(3), 2011, pp. 226-234
Bipartite induced subgraphs and well-quasi-ordering
Nicholas Korpelainen
,
Vadim V. Lozin
Journal of Graph Theory
67
(3), 2011, pp. 235-249
Forbidden triples for perfect matchings
Katsuhiro Ota
,
Michael D. Plummer
,
Akira Saito
Journal of Graph Theory
67
(3), 2011, pp. 250-259
Extremal graphs for homomorphisms
Jonathan Cutler
,
A.J. Radcliffe
Journal of Graph Theory
67
(4), 2011, pp. 261-284
Recognizing connectedness from vertex-deleted subgraphs
Andrew Bowler
,
Paul Brown
,
Trevor Fenner
,
Wendy Myrvold
Journal of Graph Theory
67
(4), 2011, pp. 285-299
Hitting all maximum cliques with a stable set using lopsided independent transversals
Andrew D. King
Journal of Graph Theory
67
(4), 2011, pp. 300-305
Seiten 1
2
>