Discrete Applied Mathematics

Foreword
pp. 1-1(1)
Authors: Faigle U.; Broersma H.; Hurink J.

On the upper chromatic number of (v₃,b₂)-configurations
pp. 3-12(10)
Authors: Arbib C.; Flammini M.

Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion
pp. 13-23(11)
Authors: Bauer¹ D.; Broersma¹ H.J.; Morgana A.; Schmeichel E.

Triangle-free graphs and forbidden subgraphs
pp. 25-33(9)
Author: Brandt S.

A note on minimum degree conditions for supereulerian graphs
pp. 35-43(9)
Authors: Broersma H.J.; Xiong¹ L.

Some approaches to a conjecture on short cycles in digraphs
pp. 45-53(9)
Authors: Broersma H.J.; Li¹ X.

k-Subdomination in graphs
pp. 55-60(6)
Authors: Chang¹ G.J.; Liaw S.-C.; Yeh² H.-G.

The structure of obstructions to treewidth and pathwidth
pp. 61-71(11)
Author: Chlebkova J.

An approximation result for the interval coloring problem on claw-free chordal graphs
pp. 73-90(18)
Authors: Confessore G.; Dell'Olmo P.; Giordani S.

A note on transitive orientations with maximum sets of sources and sinks
pp. 91-95(5)
Authors: de Figueiredo C.M.H.; Gimbel J.; Mello C.P.; Szwarcfiter J.L.

Graphs having distance-n domination number half their order
pp. 97-107(11)
Authors: Fischermann M.; Volkmann L.

The cycle structure of regular multipartite tournaments
pp. 109-116(8)
Authors: Guo¹ Y.; Kwak² J.H.

An inductive definition of cubic toroidal maps
pp. 117-140(24)
Author: Harmuth T.

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
pp. 141-157(17)
Authors: Klavzar¹ S.; Milutinovic U.; Petr C.

A single-element extension of antimatroids
pp. 159-164(6)
Author: Nakamura M.

Coloring permutation graphs in parallel
pp. 165-195(31)
Author: Nikolopoulos S.D.

A fast algorithm for the maximum clique problem
pp. 197-207(11)
Author: Ostergard P.R.J.

The incidentor coloring of multigraphs and its applications
pp. 209-217(9)
Author: Pyatkin¹ A.V.

Vertex pancyclic graphs
pp. 219-237(19)
Authors: Randerath B.; Schiermeyer I.; Tewes M.; Volkmann L.

Pancyclic orderings of in-tournaments
pp. 239-249(11)
Author: Tewes M.

Length-bounded disjoint paths in planar graphs
pp. 251-261(11)
Authors: van der Holst H.; de Pina¹ J.C.

Polyhedral graphs with extreme numbers of types of faces
pp. 263-274(12)
Author: Walther H.

Algorithm for recognizing Cartesian graph bundles
pp. 275-302(28)
Authors: Zmazek¹ B.; Zerovnik J.

Author index
pp. 303-304(2)