Packing of graphs and permutations -- a survey
From MaRDI portal
Publication:1422441
DOI10.1016/S0012-365X(03)00296-6zbMath1031.05041MaRDI QIDQ1422441
Publication date: 14 February 2004
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (12)
Labeled embedding of \((n, n-2)\)-graphs in their complements ⋮ Placing two edge-disjoint copies of a tree into a bipartite graph ⋮ Embedding rainbow trees with applications to graph labelling and decomposition ⋮ Packing a number of copies of a \(( p , q )\)-graph ⋮ Packing three copies of a tree into a complete bipartite graph ⋮ Packing \([1, \Delta \)-factors in graphs of small degree] ⋮ A proof of Ringel's conjecture ⋮ Unnamed Item ⋮ Labeled 2-packings of trees ⋮ Packing trees in complete bipartite graphs ⋮ A note on packing two copies of a tree into a graph with small maximum degree ⋮ Labeled packing of cycles and circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- Packing three copies of a tree into a complete graph
- Embedding (p,p - 1) graphs in their complements
- Fixed-point-free embeddings of graphs in their complements
- The complete graph \(t\)-packings and \(t\)-coverings
- Embedding graphs of small size
- Packing graphs: The packing problem solved
- A dynamic survey of graph labeling
- A note on the ``packing of two copies of some trees into their third power
- Packing graphs in their complements
- On cyclically embeddable \((n,n-1)\)-graphs
- Graphs self-complementary in \(K_ n-e\)
- Packing of graphs - a survey
- Packing three trees
- Packing two copies of a tree into its fourth power
- Triple placement of graphs
- Selbstkomplementäre Graphen
- On self‐complementation
- Embedding graphs in their complements
- Every (p,p-2) graph is contained in its complement
- Isomorphic Factorisations. I: Complete Graphs
- On cyclically embeddable (n,n)-graphs
- On cyclically embeddable graphs
- Remarks on the placeability of isomorphic trees in a complete graph
- Self-complementary graphs
- On the packing of three graphs
This page was built for publication: Packing of graphs and permutations -- a survey
