Packing two copies of a tree into its fourth power

DOI10.1016/S0012-365X(99)00177-6zbMath0956.05080OpenAlexW1972198857MaRDI QIDQ1970711

Mariusz Woźniak, Hamamache Kheddouci, Jean-François Saclé

Publication date: 7 March 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)00177-6

zbMATH Keywords

embeddingpacking

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (8)

Packing two copies of a tree into its third power ⋮ Packing of graphs and permutations -- a survey ⋮ A note on the ``packing of two copies of some trees into their third power ⋮ Packing three copies of a tree into its sixth power ⋮ Chromatic sets of power graphs and their application to resource placement in multicomputer networks ⋮ Exact values for theb-chromatic number of a power completek-ary tree ⋮ Labeled 2-packings of trees ⋮ Labeled packing of cycles and circuits

This page was built for publication: Packing two copies of a tree into its fourth power