A note on the ``packing of two copies of some trees into their third power'' (Q1431988): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Packing two copies of a tree into its fourth power / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every (p,p-2) graph is contained in its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3715121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing three copies of a tree into a complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137222 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871134 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing trees into complete bipartite graphs / rank
 
Normal rank

Latest revision as of 16:52, 6 June 2024

scientific article
Language Label Description Also known as
English
A note on the ``packing of two copies of some trees into their third power''
scientific article

    Statements

    A note on the ``packing of two copies of some trees into their third power'' (English)
    0 references
    11 June 2004
    0 references
    Embedding
    0 references
    Packing
    0 references
    Permutation
    0 references
    Placement
    0 references
    Power tree
    0 references

    Identifiers