Displaying similar documents to “Packing of (0, 1)-matrices”

A Note on Uniquely Embeddable Forests

Justyna Otfinowska, Mariusz Woźniak (2013)

Discussiones Mathematicae Graph Theory

Similarity:

Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.

A note on careful packing of a graph

M. Woźniak (1995)

Discussiones Mathematicae Graph Theory

Similarity:

Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n-2, then there is an edge-disjoint placement of two copies of G into Kₙ. We prove that with the same condition on size of G we have actually (with few exceptions) a careful packing of G, that is an edge-disjoint placement of two copies of G into Kₙ∖Cₙ.