Packing of graphs and permutations -- a survey
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 426373 (Why is no real title available?)
- scientific article; zbMATH DE number 3650602 (Why is no real title available?)
- scientific article; zbMATH DE number 3943825 (Why is no real title available?)
- scientific article; zbMATH DE number 3652373 (Why is no real title available?)
- scientific article; zbMATH DE number 1022391 (Why is no real title available?)
- scientific article; zbMATH DE number 861401 (Why is no real title available?)
- scientific article; zbMATH DE number 3194323 (Why is no real title available?)
- A dynamic survey of graph labeling
- A note on the ``packing of two copies of some trees into their third power
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Embedding graphs in their complements
- Embedding graphs of small size
- Every (p,p-2) graph is contained in its complement
- Fixed-point-free embeddings of graphs in their complements
- Graphs self-complementary in \(K_ n-e\)
- Isomorphic Factorisations. I: Complete Graphs
- On cyclically embeddable (n,n)-graphs
- On cyclically embeddable \((n,n-1)\)-graphs
- On cyclically embeddable graphs
- On self‐complementation
- On the packing of three graphs
- Packing graphs in their complements
- Packing graphs: The packing problem solved
- Packing of graphs - a survey
- Packing three copies of a tree into a complete graph
- Packing three trees
- Packing two copies of a tree into its fourth power
- Remarks on the placeability of isomorphic trees in a complete graph
- Selbstkomplementäre Graphen
- Self-complementary graphs
- The complete graph \(t\)-packings and \(t\)-coverings
- Triple placement of graphs
Cited in
(20)- A proof of Ringel's conjecture
- Packing of graphs and permutations
- Packing trees into complete \(k\)-partite graph
- A note on packing two copies of a tree into a graph with small maximum degree
- Packing \([1, \Delta ]\)-factors in graphs of small degree
- On cyclically embeddable (n,n)-graphs
- Placing two edge-disjoint copies of a tree into a bipartite graph
- scientific article; zbMATH DE number 4127266 (Why is no real title available?)
- Packing of graphs - a survey
- Embedding rainbow trees with applications to graph labelling and decomposition
- Labeled 2-packings of trees
- Unstable graphs and packing into fifth power
- Packing three copies of a tree into a complete bipartite graph
- A note on uniquely embeddable graphs
- Labeled embedding of \((n, n-2)\)-graphs in their complements
- Packing trees in complete bipartite graphs
- Packing a number of copies of a \(( p , q )\)-graph
- Labeled packing of non star trees into their \(k\) th power, \(k\geq 5\)
- Labeled packing of cycles and circuits
- On uniqueness of packing of three copies of 2-factors
This page was built for publication: Packing of graphs and permutations -- a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1422441)
