Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF01788669
Title: Some extensions of a hypergraph
Authors: Shee, S.-C. 
Issue Date: Dec-1989
Citation: Shee, S.-C. (1989-12). Some extensions of a hypergraph. Graphs and Combinatorics 5 (1) : 189-196. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01788669
Abstract: It is shown how to construct a vertex-transitive hypergraph X* from a suitable collection of isomorphic copies of a given hypergraph X by identifying one or none of the vertices of every two copies in the collection. Moreover X* and X have the same strong chromatic number. If the hypergraph X is edge-coloured, then X* can be so constructed that it is strongly vertex-colour-transitive. This paper also considers the case where a section hypergraph or none of the vertices of every two isomorphic copies is identified in the construction of X*. © 1989 Springer-Verlag.
Source Title: Graphs and Combinatorics
URI: http://scholarbank.nus.edu.sg/handle/10635/104159
ISSN: 09110119
DOI: 10.1007/BF01788669
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

Page view(s)

35
checked on Sep 7, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.