Packing trees in complete bipartite graphs (Q2062685): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.2252 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2987204348 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding (p,p - 1) graphs in their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2876050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-placement of (p,q)-trees / 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: Packing two forests into a bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing three copies of a tree into a complete bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs and permutations -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs - a survey / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:40, 27 July 2024

scientific article
Language Label Description Also known as
English
Packing trees in complete bipartite graphs
scientific article

    Statements

    Packing trees in complete bipartite graphs (English)
    0 references
    0 references
    3 January 2022
    0 references
    packing
    0 references
    placement
    0 references
    edge-disjoint tree
    0 references
    bipartite graph
    0 references

    Identifiers