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 Volume=20
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The number of negative entries in a sign pattern allowing orthogonality
Yubin Gao
,
Yanling Shao
Graphs and Combinatorics
20
(3), 2004, pp. 311-317
Random hypergraph processes with degree restrictions
Catherine Greenhill
,
Andrzej Ruciński
,
Nicholas C. Wormald
Graphs and Combinatorics
20
(3), 2004, pp. 319-332
On pattern Ramsey numbers of graphs
Robert E. Jamison
,
Douglas B. West
Graphs and Combinatorics
20
(3), 2004, pp. 333-339
Hamiltonian connected claw-free graphs
MingChu Li
Graphs and Combinatorics
20
(3), 2004, pp. 341-362
Some
L
-function of a regular covering of a graph
Hirobumi Mizuno
,
Iwao Sato
Graphs and Combinatorics
20
(3), 2004, pp. 363-375
On resolvable multipartite
G
-designs
A. Muthusamy
Graphs and Combinatorics
20
(3), 2004, pp. 377-382
The number of spanning trees in
K_n
-complements of quasi-threshold graphs
Stavros D. Nikolopoulos
,
Charis Papadopoulos
Graphs and Combinatorics
20
(3), 2004, pp. 383-397
Asymptotic behaviour of the number of labelled essential acyclic digraphs and labelled chain graphs
Bertran Steinsky
Graphs and Combinatorics
20
(3), 2004, pp. 399-411
Removable edges in longest cycles of 4-connected graphs
Jichang Wu
,
Xueliang Li
Graphs and Combinatorics
20
(3), 2004, pp. 413-422
The chromaticity of certain complete multipartite graphs
Haixing Zhao
,
Xueliang Li
,
Ruying Liu
,
Chengfu Ye
Graphs and Combinatorics
20
(3), 2004, pp. 423-434
On cyclic packing of a tree
Stephan Brandt
,
Mariusz Woźniak
Graphs and Combinatorics
20
(4), 2004, pp. 435-442
Colorability of planar graphs with isolated nontriangular faces
Mark N. Ellingham
,
Herbert Fleischner
,
Martin Kochol
,
Emanuel Wenger
Graphs and Combinatorics
20
(4), 2004, pp. 443-446
Paired-domination in claw-free cubic graphs
Odile Favaron
,
Michael A. Henning
Graphs and Combinatorics
20
(4), 2004, pp. 447-456
Even
2 \times 2
submatrices of a random zero-one matrix
Anant P. Godbole
,
Joseph A. Johnson
Graphs and Combinatorics
20
(4), 2004, pp. 457-466
Minimum degree conditions for cycles including specified sets of vertices
Wayne Goddard
Graphs and Combinatorics
20
(4), 2004, pp. 467-483
A note on regular near polygons
Akira Hiraki
,
Jack Koolen
Graphs and Combinatorics
20
(4), 2004, pp. 485-497
Sum list coloring block graphs
Garth Isaak
Graphs and Combinatorics
20
(4), 2004, pp. 499-506
Edge decompositions of multigraphs into 3-matchings
Zbigniew Lonc
,
Mariusz Meszka
,
Zdzisƚaw Skupień
Graphs and Combinatorics
20
(4), 2004, pp. 507-515
On the set of cycle lengths in a Hamiltonian graph with a given maximum degree
Antoni Marczyk
Graphs and Combinatorics
20
(4), 2004, pp. 517-529
Partition of
C_4
-designs into minimum and maximum number of
P_3
-designs
Gaetano Quattrocchi
,
Zsolt Tuza
Graphs and Combinatorics
20
(4), 2004, pp. 531-540
Hamilton decomposable graphs with specified leaves
C.A. Rodger
Graphs and Combinatorics
20
(4), 2004, pp. 541-543
Cycle switches in Latin Squares
Ian M. Wanless
Graphs and Combinatorics
20
(4), 2004, pp. 545-570
A solution to a problem of Jacobson, Kézdy and Lehel
Igor Edm. Zverovich
Graphs and Combinatorics
20
(4), 2004, pp. 571-577
Seiten
<
1
2