Graph theory, Singapore 1983 : proceedings of the First Southeast Asian Graph Theory Colloquium, held in Singapore, May 10-28, 1983
Author(s)
Bibliographic Information
Graph theory, Singapore 1983 : proceedings of the First Southeast Asian Graph Theory Colloquium, held in Singapore, May 10-28, 1983
(Lecture notes in mathematics, 1073)
Springer-Verlag, 1984
- : gw
- : us
Available at 71 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
Note
Includes bibliographical references
Description and Table of Contents
Table of Contents
On supercompact graphs III: The edge nucleus.- Monochromatic reachability, complementary cycles, and single arc reversals in tournaments.- Cycles in abelian cayley graphs with a proscribed vertex.- On the minimum number of arcs to reverse to make a graph strongly connected.- Computational complexity of graph properties.- Lectures on the marriage theorem of aharoni, nash-williams and shelah.- A graphical colour-representation of a group.- General connectivity.- Cube factors.- Concentric subgraphs, closed subsets and dense graphs.- The binding number of product graphs.- Rigidity of multi-graphs II.- The mobility of a graph.- Random subgraphs of regular graphs.- Graph factors with given properties.- Some definitions of central structures.- Equalities involving certain graphical distributions.- A collection of sets related to the tutte polynomial of a matroid.- Are all polyominoes arbitrarily graceful?.- Generalized ramsey theory XV: Achievement and avoidance games for bipartite graphs.- On the reconstructibility of almost complete r-partite graphs.- Graphical colour-representation of an inverse semigroup.- Eulerian chains and segment reversals.- Degree sequences of connected hypergraphs and hypertrees.- The computational complexity of recognizing critical sets.- An algorithm for the directed T-immersion of a graph.- Reconstruction conjecture for square of a tree.- Cycle graphs.- Chain decompositions of graphs, 1: Abstract graphs.- Chain decompositions of graphs, 2: Surface embeddings.- Unsolved problems.
by "Nielsen BookData"