Packing a number of copies of a \(( p , q )\)-graph (Q2217483): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Embedding Arbitrary Graphs of Maximum Degree Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Tree Packing Conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on packing trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings of graphs and applications to computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(d\)-degenerate graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / 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: Embedding (p,p - 1) graphs in their complements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing two graphs of even girth 10 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Graphs of Bounded Codegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on packing trees into complete bipartite graphs and on Fishburn's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Bollobás–Eldridge Conjecture for Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Bollobás and Eldridge for graphs of maximum degree three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of the tree packing conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing trees into \(n\)-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4170743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A list version of graph packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2876050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3952131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing trees in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packings of bounded degree trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the packing of three graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a packing problem of Alon and Yuster / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge disjoint placement of graphs / 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 of three copies of a 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: Triple placement of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of graphs - a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On packing trees into complete bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on \(k\)-placeable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing large trees of consecutive orders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4186364 / rank
 
Normal rank

Latest revision as of 07:01, 24 July 2024

scientific article
Language Label Description Also known as
English
Packing a number of copies of a \(( p , q )\)-graph
scientific article

    Statements

    Packing a number of copies of a \(( p , q )\)-graph (English)
    0 references
    0 references
    0 references
    29 December 2020
    0 references
    0 references
    \( ( p
    0 references
    q )\)-graph
    0 references
    2-factor
    0 references
    \(k\)-placeable
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references