Discrete Applied Mathematics

IFC (Editorial Board)
pp. CO2-CO2(1)

Contents
pp. v-vii

Symmetry properties of chordal rings of degree 3
pp. 211-232(22)
Author: Barriere L.

Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
pp. 233-262(30)
Author: Benczur A.A.

Minimum 3-geodetically connected graphs
pp. 263-283(21)
Author: Bosikova M.

On linear and circular structure of (claw, net)-free graphs
pp. 285-303(19)
Authors: Brandstadt A.; Dragan F.F.

Bounds on the average connectivity of a graph
pp. 305-318(14)
Authors: Dankelmann P.; Oellermann O.R.

Efficient dominating sets in Cayley graphs
pp. 319-328(10)
Authors: Dejter I.J.; Serra O.

Generating r-regular graphs
pp. 329-343(15)
Authors: Ding G.; Chen P.

Interval degree and bandwidth of a graph
pp. 345-359(15)
Authors: Fomin F.V.; Golovach P.A.

The complexity of the T-coloring problem for graphs with small degree
pp. 361-369(9)
Authors: Giaro K.; Janczewski R.; Malafiejski M.

A polynomial algorithm for finding T-span of generalized cacti
pp. 371-382(12)
Authors: Giaro K.; Janczewski R.; Malafiejski M.

Planar k-cycle resonant graphs with k=1,2
pp. 383-397(15)
Authors: Guo X.; Zhang F.

Classification of whist tournaments with up to 12 players
pp. 399-407(9)
Authors: Haanpaa H.; Ostergard P.R.J.

Cycles identifying vertices and edges in binary hypercubes and 2-dimensional tori
pp. 409-419(11)
Authors: Honkala I.; Karpovsky M.G.; Litsyn S.

Using transforming matrices to generate DNA clone grids
pp. 421-431(11)
Authors: Huang H.-M.; Hwang F.K.; Ma J.-F.

2-Approximation algorithms for the multi-vehicle scheduling problem on a path with release and handling times
pp. 433-447(15)
Authors: Karuno Y.; Nagamochi H.

Computing graph invariants on rotagraphs using dynamic algorithm approach: the case of (2,1)-colorings and independence numbers
pp. 449-460(12)
Authors: Klavzar S.; Vesel A.

Approximating covering integer programs with multiplicity constraints
pp. 461-473(13)
Author: Kolliopoulos S.G.

On the minimum local-vertex-connectivity augmentation in graphs
pp. 475-486(12)
Authors: Nagamochi H.; Ishii T.

Excluded-minor characterizations of antimatroids arisen from posets and graph searches
pp. 487-498(12)
Author: Nakamura M.

On strong Menger-connectivity of star graphs
pp. 499-511(13)
Authors: Oh E.; Chen J.

Domination analysis of combinatorial optimization problems
pp. 513-520(8)
Authors: Gutin G.; Vainshtein A.; Yeo A.

On variations of P₄-sparse graphs
pp. 521-532(12)
Authors: Brandstadt A.; Mosca R.

Upper bounds on ATSP neighborhood size
pp. 533-538(6)
Authors: Gutin G.; Yeo A.

A simple minimum T-cut algorithm
pp. 539-544(6)
Author: Rizzi R.

Pairs of graphs with site and bond percolation critical probabilities in opposite orders
pp. 545-548(4)
Author: Wierman J.C.

Author index to volume 129
pp. 549-551(3)