Labeled 2-packings of trees
From MaRDI portal
Publication:2514165
DOI10.1016/j.disc.2014.12.015zbMath1306.05221OpenAlexW2064248156MaRDI QIDQ2514165
Hamamache Kheddouci, Eric Duchêne, Mohammed Amin Tahraoui
Publication date: 30 January 2015
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2014.12.015
Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items
Labeled embedding of \((n, n-2)\)-graphs in their complements, Labeled packing of cycles and circuits
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge disjoint placement of graphs
- Embedding (p,p - 1) graphs in their complements
- Packings of graphs and applications to computational complexity
- Fixed-point-free embeddings of graphs in their complements
- Packing of graphs and permutations -- a survey
- A note on the ``packing of two copies of some trees into their third power
- Packing of graphs - a survey
- Packing two copies of a tree into its fourth power
- On self‐complementation
- Embedding graphs in their complements