152048-Thumbnail Image.png

A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices…

A tiling is a collection of vertex disjoint subgraphs called tiles. If the tiles are all isomorphic to a graph $H$ then the tiling is an $H$-tiling. If a graph $G$ has an $H$-tiling which covers all of the vertices of $G$ then the $H$-tiling is a perfect $H$-tiling or an $H$-factor.

Copyright Statement
    • Reuse Permissions
  • All Rights Reserved
    • Downloads
    pdf (653.8 KB)

    Download count: 0

    Details

    Contributors
    Date Created
    2013
    Subjects
    Resource Type
  • Text
    • Collections this item is in
    ASU Electronic Theses and Dissertations
    Note
    • Partial requirement for: Ph.D., Arizona State University, 2013
      Note type
      thesis
    • Includes bibliographical references (p. 108-110)
      Note type
      bibliography
    • Field of study: Mathematics

    Citation and reuse

    Statement of Responsibility

    by Theodore Molla

    Machine-readable links