Discrete Applied Mathematics

Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness
pp. 163-179(17)
Authors: Cheng¹ E.; Lipman M.J.

Bounds for parametric sequence comparison
pp. 181-198(18)
Authors: Fernandez-Baca¹ D.; Seppalainen² T.; Slutzki G.

A 2-approximation algorithm for the minimum weight edge dominating set problem
pp. 199-207(9)
Authors: Fujito T.; Nagamochi H.

Boundary uniqueness of fusenes
pp. 209-222(14)
Authors: Guo X.; Hansen P.; Zheng M.

On the perfect matching of disjoint compact sets by noncrossing line segments in Rⁿ
pp. 223-238(16)
Authors: Hosono K.; Matsuda K.

On the computational complexity of strong edge coloring
pp. 239-248(10)
Author: Mahdian M.

Graph representations of a bicircular matroid
pp. 249-262(14)
Author: Neudauer N.A.

The centdian subtree on tree networks
pp. 263-278(16)
Authors: Tamir A.; Puerto¹ J.; Perez-Brito² D.

Finding all the negative cycles in a directed graph
pp. 279-291(13)
Authors: Yamada T.; Kinoshita H.

Verifiable broadcasting and gossiping in communication networks
pp. 293-298(6)
Authors: Berman K.A.; Paul J.L.

Erratum to ''Comparison of column generation models for channel assignment in cellular networks'' - [Discrete Appl. Math. 112 (2001) 217-240]
pp. 299-322(24)
Authors: Jaumard B.; Marcotte O.; Meyer C.; Vovor T.

Author Index to Volume 118 (2002)
pp. 323-324(2)