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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Lower semimodular types of lattices: Frankl's conjecture holds for lower quasi-semimodular lattices
Tetsuya Abe
,
Bumpei Nakano
Graphs and Combinatorics
16
(1), 2000, pp. 1-16
Closure concepts: A survey
Hajo Broersma
,
Zdenȇk Ryjác̑ek
,
Ingo Schiermeyer
Graphs and Combinatorics
16
(1), 2000, pp. 17-48
Decompositions of complete multipartite graphs into cycles of even length
Nicholas J. Cavenagh
,
Elizabeth J. Billington
Graphs and Combinatorics
16
(1), 2000, pp. 49-65
Cycles in 2-factors of balanced bipartite graphs
Guantao Chen
,
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
16
(1), 2000, pp. 67-80
Vertex-disjoint cycles containing specified edges
Yoshimi Egawa
,
Ralph J. Faudree
,
Ervin Györi
,
Yoshiyasu Ishigami
,
Richard H. Schelp
,
Hong Wang
Graphs and Combinatorics
16
(1), 2000, pp. 81-92
Symmetric graph designs
H.-D.O.F. Gronau
,
R.C. Mullin
,
A. Rosa
,
P.J. Schellenberg
Graphs and Combinatorics
16
(1), 2000, pp. 93-102
On Hamiltonian powers of digraphs
Antoni Marczyk
Graphs and Combinatorics
16
(1), 2000, pp. 103-113
Frankl's conjecture is true for lower semimodular lattices
Jürgen Reinhold
Graphs and Combinatorics
16
(1), 2000, pp. 115-116
Decomposition of graphs into
(g,f)
-factors
G.Y. Yan
,
J.F. Pan
,
C.K. Wong
,
Taro Tokuda
Graphs and Combinatorics
16
(1), 2000, pp. 117-126
How tight is the Bollobás-Komlós conjecture?
Sarmad Abbasi
Graphs and Combinatorics
16
(2), 2000, pp. 129-137
On a variation of Schur numbers
Arie Bialostocki
,
Daniel Schaal
Graphs and Combinatorics
16
(2), 2000, pp. 139-147
The generation of maximal triangle-free graphs
Stephan Brandt
,
Gunnar Brinkmann
,
Thomas Harmuth
Graphs and Combinatorics
16
(2), 2000, pp. 149-157
The maximum genus on a 3-vertex-connected graph
Yuangqiu Huang
Graphs and Combinatorics
16
(2), 2000, pp. 159-164
Group connectivity of 3-edge-connected chordal graphs
Hong-Jian Lai
Graphs and Combinatorics
16
(2), 2000, pp. 165-176
Longest cycles in almost claw-free graphs
MingChu Li
Graphs and Combinatorics
16
(2), 2000, pp. 177-198
Matroids and graphs with few non-essential elements
James Oxley
,
Haidong Wu
Graphs and Combinatorics
16
(2), 2000, pp. 199-229
The 2-pebbling property and a conjecture of Graham's
Hunter S. Snevily
,
James A. Foster
Graphs and Combinatorics
16
(2), 2000, pp. 231-244
Edge colorings of embedded graphs
Zhongde Yan
,
Yue Zhao
Graphs and Combinatorics
16
(2), 2000, pp. 245-256
Uniquely edge-3-colorable graphs and snarks
John L. Goldwasser
,
Cun-Quan Zhang
Graphs and Combinatorics
16
(3), 2000, pp. 257-267
On the existence of a long path between specified vertices in a 2-connected graph
Kazuhide Hirohata
Graphs and Combinatorics
16
(3), 2000, pp. 269-273
On minimum-weight
k
-edge connected Steiner networks on metric spaces
D. Frank Hsu
,
Xiao-Dong Hu
,
Guo-Hui Lin
Graphs and Combinatorics
16
(3), 2000, pp. 275-284
On the 3-connected matroids that are minimal having a fixed restriction
Manoel Lemos
,
James Oxley
,
Talmage James Reid
Graphs and Combinatorics
16
(3), 2000, pp. 285-318
On cycles in 3-connected graphs
Hao Li
Graphs and Combinatorics
16
(3), 2000, pp. 319-335
On non-essential edges in 3-connected graphs
Talmage James Reid
,
Haidong Wu
Graphs and Combinatorics
16
(3), 2000, pp. 337-354
A note on range-restricted circuit covers
Romeo Rizzi
Graphs and Combinatorics
16
(3), 2000, pp. 355-358
Seiten 1
2
>