• Admin
    UC Research Repository
    View Item 
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
       
    • UC Home
    • Library
    • UC Research Repository
    • College of Engineering
    • Engineering: Journal Articles
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of the RepositoryCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

    Statistics

    View Usage Statistics

    A characterization for a set of partial partitions to define an X-tree

    Thumbnail
    View/Open
    45499_Main.pdf (175.5Kb)
    Author
    Semple, C.
    Steel, M.
    Date
    2002
    Permanent Link
    http://hdl.handle.net/10092/241

    Trees whose vertices are partially labelled by elements of a finite set X provide a natural way to represent partitions of subsets of X. The condition under which a given collection of such partial partitions of X can be represented by a tree has previously been characterized in terms of a chordal graph structure on an underlying intersection graph. In this paper, we obtain a related graph-theoretic characterization for the uniqueness of a tree representation of a set of partial partitions of X.

    Subjects
    X-trees
     
    chordal graphs
     
    partition intersection graphs
     
    free X-trees
     
    Fields of Research::230000 Mathematical Sciences::239900 Other Mathematical Sciences::239901 Biological Mathematics
    Collections
    • Engineering: Journal Articles [932]
    Rights
    http://library.canterbury.ac.nz/ir/rights.shtml

    UC Research Repository
    University Library
    University of Canterbury
    Private Bag 4800
    Christchurch 8140

    Phone
    364 2987 ext 8718

    Email
    ucresearchrepository@canterbury.ac.nz

    Follow us
    FacebookTwitterYoutube

    © University of Canterbury Library
    Send Feedback | Contact Us