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=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The maximal number of induced
r
-partite subgraphs
Béla Bollobás
,
Yoshimi Egawa
,
Andrew Harris
,
Guoping Jin
Graphs and Combinatorics
11
, 1995, pp. 1-19
Degree sums,
k
-factors and Hamilton cycles in graphs
R.J. Faudree
,
J. van den Heuvel
Graphs and Combinatorics
11
, 1995, pp. 21-28
On the capacity of Boolean graph formulæ
Luisa Gargano
,
János Körner
,
Ugo Vaccaro
Graphs and Combinatorics
11
, 1995, pp. 29-48
A generalization of Menger's theorem for certain block-cactus graphs
Yubao Guo
,
Lutz Volkmann
Graphs and Combinatorics
11
, 1995, pp. 49-52
A note on a conjecture of Gallai
P.E. Haxell
Graphs and Combinatorics
11
, 1995, pp. 53-57
The chip firing game on
n
-cycles
Janice Jeffs
,
Suzanne Seager
Graphs and Combinatorics
11
, 1995, pp. 59-67
Factorizations of product graphs into cycles of uniform length
A. Muthusamy
,
P. Paulraja
Graphs and Combinatorics
11
, 1995, pp. 69-90
A note on the three color problem
Daniel P. Sanders
,
Yue Zhao
Graphs and Combinatorics
11
, 1995, pp. 91-94
Decomposing the complete graph into cycles of many lengths
Darryn E. Bryant
,
Peter Adams
Graphs and Combinatorics
11
, 1995, pp. 97-102
A matrix equation for association schemes
L. Chihara
,
D. Stanton
Graphs and Combinatorics
11
, 1995, pp. 103-108
The Ulam number of infinite graphs
Kiran B. Chilakamarri
,
Nathaniel Dean
Graphs and Combinatorics
11
, 1995, pp. 109-120
Right angle free subsets in the plane
B. Gamble
,
W. Pulleyblank
,
B. Reed
,
B. Shepherd
Graphs and Combinatorics
11
, 1995, pp. 121-129
Minimum order of Loop networks of given degree and girth
Y.O. Hamidoune
,
A.S. Llado
,
O. Serra
Graphs and Combinatorics
11
, 1995, pp. 131-138
A remark on bipartite distance-regular graphs of even valency
K. Nomura
Graphs and Combinatorics
11
, 1995, pp. 139-140
2-reducible cycles containing three consecutive edges in
(2k+1)
-edge-connected graphs
Haruko Okamura
Graphs and Combinatorics
11
, 1995, pp. 141-170
Recognizing Bull-free perfect graphs
Bruce Reed
,
Najiba Sbihi
Graphs and Combinatorics
11
, 1995, pp. 171-178
What we know and what we do not know about Turán numbers
Alexander Sidorenko
Graphs and Combinatorics
11
, 1995, pp. 179-199
Kite-free
P
-and
Q
-polynomial schemes
Chih-Wen Weng
Graphs and Combinatorics
11
, 1995, pp. 201-207
A new family of 4-designs
Jürgen Bierbrauer
Graphs and Combinatorics
11
, 1995, pp. 209-211
On clique convergent graphs
Claudson F. Bornstein
,
Jayme L. Szwarcfiter
Graphs and Combinatorics
11
, 1995, pp. 213-220
Hamiltonicity in balanced
k
-partite graphs
Guantao Chen
,
Ralph J. Faudree
,
Ronald J. Gould
,
Michael S. Jacobson
,
Linda Lesniak
Graphs and Combinatorics
11
, 1995, pp. 221-231
Cycle-pancyclism in tournaments I
Hortensia Galeana-Sánchez
,
Sergio Rajsbaum
Graphs and Combinatorics
11
, 1995, pp. 233-243
A condition for matchability in hypergraphs
P.E. Haxell
Graphs and Combinatorics
11
, 1995, pp. 245-248
Discs in unbreakable graphs
Ryan B. Hayward
Graphs and Combinatorics
11
, 1995, pp. 249-254
An extremal problem for cycles in Hamiltonian graphs
George R.T. Hendry
,
Stephan Brandt
Graphs and Combinatorics
11
, 1995, pp. 255-262
Seiten 1
2
>