Graph Theory Singapore 1983

On supercompact graphs III: The edge nucleus....Pages 1-10
Monochromatic reachability, complementary cycles, and single arc reversals in tournaments....Pages 11-21
Cycles in abelian cayley graphs with a proscribed vertex....Pages 22-30
On the minimum number of arcs to reverse to make a graph strongly connected....Pages 31-34
Computational complexity of graph properties....Pages 35-54
Lectures on the marriage theorem of aharoni, nash-williams and shelah....Pages 55-79
A graphical colour-representation of a group....Pages 80-82
General connectivity....Pages 83-92
Cube factors....Pages 93-99
Concentric subgraphs, closed subsets and dense graphs....Pages 100-118
The binding number of product graphs....Pages 119-128
Rigidity of multi-graphs II....Pages 129-134
The mobility of a graph....Pages 135-149
Random subgraphs of regular graphs....Pages 150-160
Graph factors with given properties....Pages 161-168
Some definitions of central structures....Pages 169-178
Equalities involving certain graphical distributions....Pages 179-192
A collection of sets related to the tutte polynomial of a matroid....Pages 193-204
Are all polyominoes arbitrarily graceful?....Pages 205-211
Generalized ramsey theory XV: Achievement and avoidance games for bipartite graphs....Pages 212-216
On the reconstructibility of almost complete r-partite graphs....Pages 217-221
Graphical colour-representation of an inverse semigroup....Pages 222-227
Eulerian chains and segment reversals....Pages 228-235
Degree sequences of connected hypergraphs and hypertrees....Pages 236-247
The computational complexity of recognizing critical sets....Pages 248-253
An algorithm for the directed T-immersion of a graph....Pages 254-267
Reconstruction conjecture for square of a tree....Pages 268-278
Cycle graphs....Pages 279-293
Chain decompositions of graphs, 1: Abstract graphs....Pages 294-306
Chain decompositions of graphs, 2: Surface embeddings....Pages 307-323
Unsolved problems....Pages 324-335