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=Graphs and Combinatorics AND YEAR=2011
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Spanning trees: A survey
Kenta Ozeki Yamashita
,
Tomoki
Graphs and Combinatorics
27
(1), 2011, pp. 1-26
The cycle discrepancy of three-regular graphs
Sarmad Abbasi
,
Laeeq Aslam
Graphs and Combinatorics
27
(1), 2011, pp. 27-46
Every large point set contains many collinear points or an empty pentagon
Zachary Abel
,
Brad Ballinger
,
Prosenjit Bose
,
Sébastien Collette
,
Vida Dujmović
,
Ferran Hurtado
,
Scott Duke Kominers
,
Stefan Langerman
,
Attila Pór
,
David R. Wood
Graphs and Combinatorics
27
(1), 2011, pp. 47-60
Boxicity of leaf powers
L. Sunil Chandran
,
Mathew C. Francis
,
Rogers Mathew
Graphs and Combinatorics
27
(1), 2011, pp. 61-72
Looseness of plane graphs
Július Czap
,
Stanislav Jendrol'
,
Frantis̑ek Kardos̑
,
Jozef Mis̑kuf
Graphs and Combinatorics
27
(1), 2011, pp. 73-85
Random planar graphs with bounds on the maximum and minimum degrees
Chris Dowden
Graphs and Combinatorics
27
(1), 2011, pp. 87-107
A note on lights-out-puzzle: Parity-state graphs
Severino V. Gervacio
,
Hiroshi Maehara
Graphs and Combinatorics
27
(1), 2011, pp. 109-119
Ramsey numbers of some bipartite graphs versus complete graphs
Tao Jiang
,
Michael Salerno
Graphs and Combinatorics
27
(1), 2011, pp. 121-128
The
p
-bondage number of trees
You Lu
,
Jun-Ming Xu
Graphs and Combinatorics
27
(1), 2011, pp. 129-141
On partitioning the edge set of a graph into internally disjoint paths without exterior vertices
G.R. Vijayakumar
Graphs and Combinatorics
27
(1), 2011, pp. 143-148
Automorphic decompositions of graphs
Robert A. Beeler
,
Robert E. Jamison
Graphs and Combinatorics
27
(2), 2011, pp. 149-160
Almost resolvable maximum packings of complete graphs with 4-cycles
Elizabeth J. Billington
,
Italo J. Dejter
,
D.G. Hoffman
,
C.C. Lindner
Graphs and Combinatorics
27
(2), 2011, pp. 161-170
Comparison of two techniques for proving nonexistence of strongly regular graphs
Vas̑ek Chvátal
Graphs and Combinatorics
27
(2), 2011, pp. 171-175
The number of independent sets in a graph with small maximum degree
David Galvin
,
Yufei Zhao
Graphs and Combinatorics
27
(2), 2011, pp. 177-186
Lower bound of the number of maximum genus embeddings and genus embeddings of
K12s+7
Ren Han
,
Gao Yanbo
Graphs and Combinatorics
27
(2), 2011, pp. 187-197
On 2-connected spanning subgraphs with bounded degree in
K1,r
-free graphs
Roman Kuz̑el
,
Jakub Teska
Graphs and Combinatorics
27
(2), 2011, pp. 199-206
On 3-edge-connected Supereulerian graphs
Hong-Jian Lai
,
Hao Li
,
Yehong Shao
,
Mingquan Zhan
Graphs and Combinatorics
27
(2), 2011, pp. 207-214
Algebraic connectivity of connected graphs with fixed number of pendant vertices
Arbind Kumar Lal
,
Kamal Lochan Patra
,
Binod Kumar Sahoo
Graphs and Combinatorics
27
(2), 2011, pp. 215-229
Infinitely many Hypohamiltonian cubic graphs of girth 7
Edita Mác̑ajová
,
Martin S̑koviera
Graphs and Combinatorics
27
(2), 2011, pp. 231-241
Properly edge-coloured subgraphs in colourings of bounded degree
Klas Markström
,
Andrew Thomason
,
Peter Wagner
Graphs and Combinatorics
27
(2), 2011, pp. 243-249
Cleaning with brooms
Margaret-Ellen Messinger
,
Richard J. Nowakowski
,
Paweƚ Praƚat
Graphs and Combinatorics
27
(2), 2011, pp. 251-267
A note on group choosability of graphs with girth at least 4
G.R. Omidi
Graphs and Combinatorics
27
(2), 2011, pp. 269-273
Superconnected and hyperconnected small degree transitive graphs
Yingzhi Tian
,
Jixiang Meng
Graphs and Combinatorics
27
(2), 2011, pp. 275-287
The
k
-restricted edge connectivity of balanced bipartite graphs
Jun Yuan
,
Aixia Liu
Graphs and Combinatorics
27
(2), 2011, pp. 289-303
Cutting a convex polyhedron out of a sphere
Syed Ishtiaque Ahmed
,
Masud Hasan
,
Md. Ariful Islam
Graphs and Combinatorics
27
(3), 2011, pp. 307-319
Seiten 1
2
3
>