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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Vertex partitions of
K_{4,4}
-minor free graphs
Leif K. Jrgensen
Graphs and Combinatorics
17
(2), 2001, pp. 265-274
Exact bounds on cross-intersecting families
Ákos Kisvölcsey
Graphs and Combinatorics
17
(2), 2001, pp. 275-287
On the crossing numbers of products of stars and graphs of order five
Marián Kles̑c̑
Graphs and Combinatorics
17
(2), 2001, pp. 289-294
On the structure of graphs with bounded asteroidal number
Ton Kloks
,
Dieter Kratsch
,
Haiko Müller
Graphs and Combinatorics
17
(2), 2001, pp. 295-306
On isomorphisms of minimal Cayley graphs and digraphs
Cai Heng Li
,
Sanming Zhou
Graphs and Combinatorics
17
(2), 2001, pp. 307-314
On the volume of 5-cycle trades
Barbara M. Maenhaut
Graphs and Combinatorics
17
(2), 2001, pp. 315-328
On improving the edge-face coloring theorem
Daniel P. Sanders
,
Yue Zhao
Graphs and Combinatorics
17
(2), 2001, pp. 329-341
An enhanced Arimoto theorem on threshold transformations
Takao Ueda
Graphs and Combinatorics
17
(2), 2001, pp. 343-351
Steiner trees on curved surfaces
J.F. Weng
Graphs and Combinatorics
17
(2), 2001, pp. 353-363
On large circuits in matroids
Pou-Lin Wu
Graphs and Combinatorics
17
(2), 2001, pp. 365-388
Perfectly weighted graphs
Lawrence Brenton
,
Lynda Jaje
Graphs and Combinatorics
17
(3), 2001, pp. 389-407
Degree-light-free graphs and Hamiltonian cycles
Guantao Chen
,
Bing Wei
,
Xuerong Zhang
Graphs and Combinatorics
17
(3), 2001, pp. 409-434
On the structure of bull-free perfect graphs - 2: The weakley chordal case
Celina M.H. de Figueiredo
,
Frédéric Maffray
,
Oscar Porto
Graphs and Combinatorics
17
(3), 2001, pp. 435-456
Four-cycle systems with two-regular leaves
H.L. Fu
,
C.A. Rodger
Graphs and Combinatorics
17
(3), 2001, pp. 457-461
Ramsey theory and bandwidth of graphs
Zoltán Füredi
,
Douglas B. West
Graphs and Combinatorics
17
(3), 2001, pp. 463-471
Solution of a conjecture of Volkmann on the number of vertices in longest paths and cycles of strong semicomplete multipartite digraphs
Gregory Gutin
,
Anders Yeo
Graphs and Combinatorics
17
(3), 2001, pp. 473-477
Bull-free weakly chordal perfectly orderable graphs
Ryan B. Hayward
Graphs and Combinatorics
17
(3), 2001, pp. 479-500
Partial parity
(g,f)
-factors and subgraphs covering given vertex subsets
M. Kano
,
Haruhide Matsuda
Graphs and Combinatorics
17
(3), 2001, pp. 501-509
Factors and connected induced subgraphs
Keiko Kotani
Graphs and Combinatorics
17
(3), 2001, pp. 511-515
A property about minimum edge-and minimum clique-cover of a graph
Raffaele Mosca
Graphs and Combinatorics
17
(3), 2001, pp. 517-528
Triangulations on closed surfaces covered by vertices of given degree
Seiya Negami
,
Atsuhiro Nakamoto
Graphs and Combinatorics
17
(3), 2001, pp. 529-537
On induced subgraphs with all degrees odd
A.D. Scott
Graphs and Combinatorics
17
(3), 2001, pp. 539-553
Degree sums, connectivity and dominating cycles in graphs
Zhiren Sun
,
Feng Tian
,
Bing Wei
Graphs and Combinatorics
17
(3), 2001, pp. 555-564
:Long cycles passing through a specified edge in 3-connected graphs
Zhiren Sun
,
Feng Tian
,
Bing Wei
Graphs and Combinatorics
17
(3), 2001, pp. 565-577
Large monotone paths in graphs with bounded degree
Raphael Yuster
Graphs and Combinatorics
17
(3), 2001, pp. 579-587
Seiten
<
1
2