On self-complementary cyclic packing of forests

zbMATH Open1182.05100MaRDI QIDQ1010622FDOQ1010622

Adam Paweł Wojda, Mariusz Woźniak, Irmina A. Zioło

Publication date: 7 April 2009

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/117185

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

forestcyclic self-complementary permutationself-complemetary graphs

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (3)

• On cyclic packing of a tree
• A framework for Coxeter spectral classification of finite posets and their mesh geometries of roots.
• A note on packing of three forests

Recommendations

• Title not available (Why is that?) 👍 👎
• Packing trees in complete graphs 👍 👎
• On packing trees into complete bipartite graphs 👍 👎
• On the Tree Packing Conjecture 👍 👎
• The cyclic sieving phenomenon for non-crossing forests 👍 👎
• Packing two forests into a bipartite graph 👍 👎
• Integral packing of trees and branchings 👍 👎
• On cyclic packing of a tree 👍 👎
• Packing trees in complete bipartite graphs 👍 👎
• On maximal independent arborescence packing 👍 👎

This page was built for publication: On self-complementary cyclic packing of forests

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010622)