Discrete Applied Mathematics 2002: Vol 120 Table of Contents

3 Pages·2002·0.58 MB·English

DISCRETE APPLIED MATHEMATICS
Volume 120, Numbers 1-3, 15 August 2002
Contents
U. Faigle, H. Broersma and J. Hurink
Foreword
C. Arbib and M. Flammini
On the upper chromatic number of (v3,b2)-configurations
D. Bauer, H.J. Broersma, A. Morgana and E. Schmeichel
Polynomial algorithms that prove an NP-Hard hypothesis implies an
NP-hard conclusion
S. Brandt
Triangle-free graphs and forbidden subgraphs
H.J. Broersma and L. Xiong
A note on minimum degree conditions for supereulerian graphs
H.J. Broersma and X. Li
Some approaches to a conjecture on short cycles in digraphs
G.J. Chang, S.-C. Liaw and H.-G. Yeh
k-Subdomination in graphs
J. Chlebrkova
The structure of obstructions to treewidth and pathwidth
G. Confessore, P. Dell‘Olmo and S. Giordani
An approximation result for the interval coloring problem on
claw-free chordal graphs
C.M.H. de Figueiredo, J. Gimbel, C.P. Mello and J.L. Szwarcfiter
A note on transitive orientations with maximum sets of sources and
sinks
M. Fischermann and L. Volkmann
Graphs having distance-n domination number half their order
Y. Guo and J.H. Kwak
The cycle structure of regular multipartite tournaments
T. Harmuth
An inductive definition of cubic toroidal maps
S. Klavzar, U. Milutinovic and C. Petr
On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi
problem
M. Nakamura
A single-element extension of antimatroids
S.D. Nikolopoulos
Coloring permutation graphs in parallel
P.R.J. Ostergard
A fast algorithm for the maximum clique problem
A.V. Pyatkin
The incidentor coloring of multigraphs and its applications
B. Randerath, |. Schiermeyer, M. Tewes and L. Volkmann
Vertex pancyclic graphs
M. Tewes
Pancyclic orderings of in-tournaments
H. van der Holst and J.C. de Pina
Length-bounded disjoint paths in planar graphs
H. Walther
Polyhedral graphs with extreme numbers of types of faces
B. Zmazek and J. Zerovnik
Algorithm for recognizing Cartesian graph bundles
prey ret,