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
[1]
Hilfe
Suche: Journal=Graphs and Combinatorics AND Volume=23
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Covering the convex quadrilaterals of point sets
Toshinori Sakai
,
Jorge Urrutia
Graphs and Combinatorics
23
(S1), 2007, pp. 343-357
Chain intersecting families
Attila Bernáth
,
Dániel Gerbner
Graphs and Combinatorics
23
(4), 2007, pp. 353-366
Recent progress on combinatorics and algorithms for low discrepancy roundings
Takeshi Tokuyama
Graphs and Combinatorics
23
(S1), 2007, pp. 359-378
On small and large hyperplanes of
DW (5, q)
B. De Bruyn
,
H. Pralle
Graphs and Combinatorics
23
(4), 2007, pp. 367-380
Improved bounds on families under
k
-wise set-intersection constraints
Weiting Cao
,
Kyung-Won Hwang
,
Douglas B. West
Graphs and Combinatorics
23
(4), 2007, pp. 381-386
Local topological toughness and local factors
Frank Göring
,
Gyula Y. Katona
Graphs and Combinatorics
23
(4), 2007, pp. 387-399
Extremal ternary self-dual codes constructed from negacirculant matrices
Masaaki Harada
,
W. Holzmann
,
H. Kharaghani
,
M. Khorvash
Graphs and Combinatorics
23
(4), 2007, pp. 401-417
An Ore-type analogue of the Sauer-Spencer Theorem
Alexandr Kostochka
,
Gexin Yu
Graphs and Combinatorics
23
(4), 2007, pp. 419-424
Cycles in circuit graphs of matroids
Ping Li
,
Guizhen Liu
Graphs and Combinatorics
23
(4), 2007, pp. 425-431
Relative length of longest paths and cycles in graphs
Huiqing Liu
,
Mei Lu
,
Feng Tian
Graphs and Combinatorics
23
(4), 2007, pp. 433-443
Score lists in tripartite hypertournaments
S. Pirzada
,
T.A. Naikoo
,
Zhou Guofei
Graphs and Combinatorics
23
(4), 2007, pp. 445-454
On an isomorphism problem of some dual hyperovals in
PG(2d +1, q)
with
q
even
Hiroaki Taniguchi
Graphs and Combinatorics
23
(4), 2007, pp. 455-465
Gray code enumeration of plane straight-line graphs
O. Aichholzer
,
F. Aurenhammer
,
C. Huemer
,
B. Vogtenhuber
Graphs and Combinatorics
23
(5), 2007, pp. 467-479
Decompositions, partitions, and coverings with convex polygons and pseudo-triangles
O. Aichholzer
,
C. Huemer
,
S. Kappes
,
B. Speckmann
,
Cs. Tóth
Graphs and Combinatorics
23
(5), 2007, pp. 481-507
Short disjoint paths in locally connected graphs
Chuanping Chen
,
Roman C̑ada
,
Tomás̑ Kaiser
,
Zdenȇk Ryjác̑ek
Graphs and Combinatorics
23
(5), 2007, pp. 509-519
Up-embeddability of a graph by order and girth
Yichao Chen
,
Yanpei Liu
Graphs and Combinatorics
23
(5), 2007, pp. 521-527
On the existence of specific stars in planar graphs
Jochen Harant
,
Stanislav Jendrol'
Graphs and Combinatorics
23
(5), 2007, pp. 529-543
On small contractible subgraphs in 3-connected graphs of small average degree
Matthias Kriesell
Graphs and Combinatorics
23
(5), 2007, pp. 545-557
Unbalanced star-factorizations of complete bipartite graphs II
Nigel Martin
Graphs and Combinatorics
23
(5), 2007, pp. 559-583
Spanning trees with few leaves
Masao Tsugaki
,
Tomoki Yamashita
Graphs and Combinatorics
23
(5), 2007, pp. 585-598
The valuations of the near octagon
H_4
B. De Bruyn
,
P. Vandecasteele
Graphs and Combinatorics
23
(6), 2007, pp. 601-623
A sharp upper bound for the number of spanning trees of a graph
Kinkar Ch. Das
Graphs and Combinatorics
23
(6), 2007, pp. 625-632
Biclique-Helly graphs
Marina Groshaus
,
Jayme L. Szwarcfiter
Graphs and Combinatorics
23
(6), 2007, pp. 633-645
Tight lower bounds on the size of a maximum matching in a regular graph
Michael A. Henning
,
Anders Yeo
Graphs and Combinatorics
23
(6), 2007, pp. 647-657
The crossing number of Cartesian products of complete bipartite graphs
K_{2,m}
with paths
P_n
Tang Ling
,
Lv Shengxiang
,
Huang Yuanqiu
Graphs and Combinatorics
23
(6), 2007, pp. 659-666
Seiten
<
1
2
3
4
>