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=J. Comb.~Theory Series B AND Volume=81
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On non-Cayley vertex-transitive graphs of order a product of three primes
Mohammad A. Iranmanesh
,
Cheryl E. Praeger
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 1-19
Random matchings which induce Hamilton cycles and Hamiltonian decompositions of random regular graphs
Jeong Han Kim
,
Nicholas C. Wormald
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 20-44
On half-transitive metacirculant graphs of prime-power order
Cai Heng Li
,
Hyo-Seob Sim
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 45-57
On the number of nonisomorphic orientable regular embeddings of complete graphs
Vladimir P. Korzhik
,
Heinz-Jurgen Voss
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 58-76
Cycle decompositions of
K_n
and
K_n-I
Brian Alspach
,
Heather Gavlas
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 77-99
On a Hamiltonian cycle in which specified vertices are uniformly distributed
Atsushi Kaneko
,
Kiyoshi Yoshimoto
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 100-109
Some results related to the evasiveness conjecture
Frank H. Lutz
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 110-124
The Terwilliger algebra of a 2-homogeneous bipartite distance-regular graph
Brian Curtin
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 125-141
Chromatic number and the 2-rank of a graph
C.D. Godsil
,
Gordon F. Royle
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 142-149
On deeply critical oriented graphs
O.V. Borodin
,
D. Fon-Der-Flaass
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 150-155
The separator theorem for rooted directed vertex graphs
B.S. Panda
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 156-162
On the maximum number of cyclic triples in oriented graphs
Lowell W. Beineke
,
Frank Harary
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 165-176
A sharp upper bound of the spectral radius of graphs
Yuan Hong
,
Jin-Long Shu
,
Kunfu Fang
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 177-183
Ramanujan edge-indexed graphs
Shahriar Mokhtari-Sharghi
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 184-204
A note on the McKay-Miller-S̑irán graphs
Jana S̑iagiová
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 205-208
Nowhere-zero flows in random graphs
Benny Sudakov
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 209-223
Determination of all regular maps of small genus
Marston Conder
,
Peter Dobcsányi
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 224-242
Balanced
0, \pm 1
matrices - I. Decomposition
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 243-274
Balanced
0, \pm 1
matrices - II. Recognition algorithm
Michele Conforti
,
Gérard Cornuéjols
,
Ajai Kapoor
,
Kristina Vus̑ković
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 275-306
On finite
s
-transitive graphs of odd order
Cai Heng Li
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 307-317
The extremal function for complete minors
Andrew Thomason
Journal of Combinatorial Theory Series B
81
(2), 2001, pp. 318-338