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=2013
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Rainbow connections of graphs: A survey
Xueliang Li
,
Yongtang Shi
,
Yuefang Sun
Graphs and Combinatorics
29
(1), 2013, pp. 1-38
On the Ramsey numbers of trees with small diameter
Patrick Bahls
,
T. Scott Spencer
Graphs and Combinatorics
29
(1), 2013, pp. 39-44
Cubicity and bandwidth
L. Sunil Chandran
,
Mathew C. Francis
,
Naveen Sivadasan
Graphs and Combinatorics
29
(1), 2013, pp. 45-69
The orthogonality spectrum for Latin squares of different orders
Peter Dukes
,
Jared Howell
Graphs and Combinatorics
29
(1), 2013, pp. 71-78
Upper bound on the diameter of a domination dot-critical graph
Michitaka Furuya
,
Masanori Takatou
Graphs and Combinatorics
29
(1), 2013, pp. 79-85
Tetravalent
s
-transitive graphs of order
4p^2
Mohsen Ghasemi
,
Jin-Xin Zhou
Graphs and Combinatorics
29
(1), 2013, pp. 87-97
New ore's type results on Hamiltonicity and existence of paths of given length in graphs
Nicolas Lichiardopol
Graphs and Combinatorics
29
(1), 2013, pp. 99-104
On superconnectivity of
(4,g)
cages
Hongliang Lu
,
Yunjian Wu
,
Yuqing Lin
,
Qinglin Yu
,
Camino Babuena
,
Xavier Marcote
Graphs and Combinatorics
29
(1), 2013, pp. 105-119
On bipartite distance-regular graphs with intersection numbers
c_i=(q^i-1)/(q-1)
S̑tefko Miklavic̑
Graphs and Combinatorics
29
(1), 2013, pp. 121-130
A refinement of leaves on noncrossing trees
Sabrina X.M. Pang
,
Lun Lv
Graphs and Combinatorics
29
(1), 2013, pp. 131-143
Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
Hongtao Zhao
,
Qingde Kang
Graphs and Combinatorics
29
(1), 2013, pp. 145-155
On the lucky choice number of graphs
S. Akbari
,
M. Ghanbari
,
R. Manaviyat
,
S. Zare
Graphs and Combinatorics
29
(2), 2013, pp. 157-163
Arc-disjoint and edge-disjoint Hamilton cycles in circulants with two jumps
Zbigniew R. Bogdanowicz
Graphs and Combinatorics
29
(2), 2013, pp. 165-171
Reduced decompositions with one repetition and permutation pattern avoidance
Daniel Daly
Graphs and Combinatorics
29
(2), 2013, pp. 173-185
Some combinatorial aspects of constructing bipartite-graph codes
Alexander A. Davydov
,
Massimo Giulietti
,
Stefano Marcugini
,
Fernanda Pambianco
Graphs and Combinatorics
29
(2), 2013, pp. 187-212
Some defective parameters in graphs
T. Ekim
,
J. Gimbel
Graphs and Combinatorics
29
(2), 2013, pp. 213-224
Simplicial girth and pure resolutions
Michael Goff
Graphs and Combinatorics
29
(2), 2013, pp. 225-240
On Vosperian and superconnected vertex-transitive digraphs
Y.O. Hamidoune
,
A. Lladó
,
S.C. López
Graphs and Combinatorics
29
(2), 2013, pp. 241-251
The endomorphism type of certain bipartite graphs and a characterization of projective planes
Ralf Köhl
,
Katja Möser
,
Hendrik Van Maldeghem
Graphs and Combinatorics
29
(2), 2013, pp. 253-257
The cyclomatic number of a graph and its independence polynomial at
-1
Vadim E. Levit
,
Eugen Mandrescu
Graphs and Combinatorics
29
(2), 2013, pp. 259-273
Spanning Eulerian subgraphs of 2-edge-connected graphs
Xiangwen Li
,
Chunxiang Wang
,
Qiong Fan
,
Zhaohong Niu
,
Liming Xiong
Graphs and Combinatorics
29
(2), 2013, pp. 275-280
The majorization theorem for signless Laplacian spectral radii of connected graphs
Bolian Liu
,
Muhuo Liu
,
Zhifu You
Graphs and Combinatorics
29
(2), 2013, pp. 281-287
Forbidden induced subgraphs for perfect matchings
Katsuhiro Ota
,
Gabriel Sueiro
Graphs and Combinatorics
29
(2), 2013, pp. 289-299
Decomposition of complete graphs into cycles and stars
Tay-Woei Shyu
Graphs and Combinatorics
29
(2), 2013, pp. 301-313
Multidecompositions of several graph products
Atif Abueida
,
Mike Daven
Graphs and Combinatorics
29
(3), 2013, pp. 315-326
Seiten 1
2
3
4
5
6
7
>