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=Discrete Appl.~Math. AND Volume=79
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Cartesian products of graphs as subgraphs of de Bruijn graphs of dimension at least three
Thomas Andreae
,
Martin Hintz
,
Michael Nölle
,
Gerald Schreiber
,
Gerald W. Schuster Hajo Seng
Discrete Applied Mathematics
79
(1-3), 1997, pp. 3-34
The complexity of recognizing tough cubic graphs
D. Bauer
,
J. van den Heuvel
,
A. Morgana
,
E. Schmeichel
Discrete Applied Mathematics
79
(1-3), 1997, pp. 35-44
Treewidth for graphs with small chordality
Hans L. Bodlaender
,
Dimitrios M. Thilikos
Discrete Applied Mathematics
79
(1-3), 1997, pp. 45-61
A sufficient condition for all short cycles
Stephan Brandt
Discrete Applied Mathematics
79
(1-3), 1997, pp. 63-66
Maximal independent sets in graphs with at most one cycle
Min-Jen Jou
,
Gerard J. Chang
Discrete Applied Mathematics
79
(1-3), 1997, pp. 67-73
Transversal partitioning in balanced hypergraphs
Elias Dahlhaus
,
Jan Kratochvíl
,
Paul D. Manuel
,
Mirka Miller
Discrete Applied Mathematics
79
(1-3), 1997, pp. 75-89
On the average Steiner distance of graphs with prescribed properties
Peter Dankelmann
,
Henda C. Swart
,
Ortrud R. Oellermann
Discrete Applied Mathematics
79
(1-3), 1997, pp. 91-103
Tree enterprises and bankruptcy ventures - A game theoretic similarity due to a graph theoretic proof
Theo S.H. Driessen
Discrete Applied Mathematics
79
(1-3), 1997, pp. 105-117
Spanning local tournaments in locally semicomplete digraphs
Yubao Guo
Discrete Applied Mathematics
79
(1-3), 1997, pp. 119-125
Bypaths in tournaments
Yubao Guo
,
Lutz Volkmann
Discrete Applied Mathematics
79
(1-3), 1997, pp. 127-135
Cardinality constrained Boolean quadratic polytope
Anuj Mehrotra
Discrete Applied Mathematics
79
(1-3), 1997, pp. 137-154
Optimal channel allocation for several types of cellular radio networks
Thomas Niessen
Discrete Applied Mathematics
79
(1-3), 1997, pp. 155-170
Characterizations and algorithmic applications of chordal graph embeddings
Andreas Parra
,
Petra Scheffler
Discrete Applied Mathematics
79
(1-3), 1997, pp. 171-188
Ramsey numbers
r(K_3,G)
for connected graphs
G
of order seven
Annette Schelten
,
Ingo Schiermeyer
Discrete Applied Mathematics
79
(1-3), 1997, pp. 189-200
Small cycles in Hamiltonian graphs
Uwe Schelten
,
Ingo Schiermeyer
Discrete Applied Mathematics
79
(1-3), 1997, pp. 201-211
The setup polyhedron of series-parallel posets
Rainer Schrader
,
Georg Wambach
Discrete Applied Mathematics
79
(1-3), 1997, pp. 213-221
Tight approximations for resource constrained scheduling and bin packing
Anand Srivastav
,
Peter Stangier
Discrete Applied Mathematics
79
(1-3), 1997, pp. 223-245
List colorings and reducibility
Zs. Tuza
,
M. Voigt
Discrete Applied Mathematics
79
(1-3), 1997, pp. 247-256
Polyhedral graphs without Hamiltonian cycles
Hansjoachim Walther
Discrete Applied Mathematics
79
(1-3), 1997, pp. 257-263
Vertex-distinguishing edge-colorings of 2-regular graphs
P. Wittmann
Discrete Applied Mathematics
79
(1-3), 1997, pp. 265-277
Coloring edges of self-complementary graphs
A. Paweƚ Wojda
,
Maƚgorzata Zwonek
Discrete Applied Mathematics
79
(1-3), 1997, pp. 279-284