Graph theory, Singapore 1983 : proceedings of the first Southeast Asian graph theory colloquium, held in Singapore, May 10-28, 1983 / K. M. Koh and H. P. Yap

Contents: Gek Ling Chia and Chong Keang Lim, On supercompact graphs. III. The edge nucleus (pp. 1–10); K. B. Reid, Monochromatic reachability, complementary cycles, and single arc reversals in tournaments (pp. 11–21); C. C. Chen [ Chuan Chong Chen] and D. A. Holton, Cycles in abelian Cayley graphs with a proscribed vertex (pp. 22–30); C. Berge, On the minimum number of arcs to reverse to make a graph strongly connected (pp. 31–34); H. P. Yap, Computational complexity of graph properties (pp. 35–54); E. C. Milner, Lectures on the marriage theorem of Aharoni, Nash-Williams and Shelah (pp. 55–79); S. C. Shee and H. H. Teh, A graphical colour-representation of a group (pp. 80–82); Frank Harary, General connectivity (pp. 83–92); Jin Akiyama and David Avis, Cube factors (pp. 93–99); K. M. Koh and N. Sauer [ Norbert Sauer], Concentric subgraphs, closed subsets and dense graphs (pp. 100–118); Jian Fang Wang, Song Lin Tian and Jiu Qiang Liu, The binding number of product graphs (pp. 119–128); Tiong Seng Tay, Rigidity of multigraphs. II (pp. 129–134); Joe Rooney and Robin J. Wilson, The mobility of a graph (pp. 135–149); Louis V. Quintas, Random subgraphs of regular graphs (pp. 150–160); Mikio Kano, Graph factors with given properties (pp. 161–168); Peter J. Slater, Some definitions of central structures (pp. 169–178); Fred Buckley, Equalities involving certain graphical distributions (pp. 179–192); Jeremy E. Dawson, A collection of sets related to the Tutte polynomial of a matroid (pp. 193–204); B. Devadas Acharya, Are all polyominoes arbitrarily graceful? (pp. 205–211); Martin Erickson and Frank Harary, Generalized Ramsey theory. XV. Achievement and avoidance games for bipartite graphs (pp. 212–216); Chun Fei Dong and Wei Guo Liu, On the reconstructibility of almost complete r-partite graphs (pp. 217–221); S. C. Shee and H. H. Teh, Graphical colour-representation of an inverse semigroup (pp. 222–227); Donald K. Skilton, Eulerian chains and segment reversals (pp. 228–235); V. Boonyasombat, Degree sequences of connected hypergraphs and hypertrees (pp. 236–247); C. J. Colbourn, M. J. Colbourn and D. R. Stinson, The computational complexity of recognizing critical sets (pp. 248–253); Wei Wu Fang, An algorithm for the directed T-immersion of a graph (pp. 254–267); S. K. Gupta, Reconstruction conjecture for square of a tree (pp. 268–278); Severino V. Gervacio, Cycle graphs (pp. 279–293); Roger B. Eggleton and Donald K. Skilton, Chain decompositions of graphs. I. Abstract graphs (pp. 294–306); Roger B. Eggleton and Donald K. Skilton, Chain decompositions of graphs. II. Surface embeddings (pp. 307–323); Unsolved problems (pp. 324–335).