Discrete Applied Mathematics

Author index
pp. I-II

Contents
pp. iv-iv(1)

A non-ambiguous decomposition of regular languages and factorizing codes
pp. 129-165(37)
Author: Anselmo M.

Edge colorings of the complete graph K₁₄₉ and the lower bounds of three Ramsey numbers
pp. 167-179(13)
Authors: Guiqing L.; Wenlong S.; Haipeng L.

Subgraphs decomposable into two trees and k-edge-connected subgraphs
pp. 181-195(15)
Authors: Hassin R.; Levin A.

Edge dominating set and colorings on graphs with fixed clique-width
pp. 197-221(25)
Authors: Kobler D.; Rotics U.

Gridline graphs: a review in two dimensions and an extension to higher dimensions
pp. 223-239(17)
Author: Peterson D.

Periodicity vectors for labelled trees
pp. 241-260(20)
Authors: Restivo A.; Silva P.V.

Finding paths in graphs avoiding forbidden transitions
pp. 261-273(13)
Author: Szeider S.

A primal-dual approximation algorithm for the survivable network design problem in hypergraphs
pp. 275-289(15)
Authors: Zhao L.; Nagamochi H.; Ibaraki T.

Determination of the star valency of a graph
pp. 291-296(6)
Authors: Dong J.; Liu Y.; Zhang C.-Q.

Recognizing clique graphs of directed edge path graphs
pp. 297-304(8)
Authors: Gutierrez M.; Meidanis J.

Efficient dualization of O(logn)-term monotone disjunctive normal forms
pp. 305-312(8)
Author: Makino K.

A note on greedy algorithms for the maximum weighted independent set problem
pp. 313-322(10)
Authors: Sakai S.; Togasaki M.; Yamazaki K.