Packing and covering of the complete graph with a graph G of four vertices or less (Q1055440): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5580172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(G\)-decomposition of \(K_n\), where G has four vertices or less / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of complete graphs into stars / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3901534 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal coverings of pairs by triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5345646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering of pairs by quadruples. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the covering of pairs by quadruples. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and Covering of the Complete Graph with 4-Cycles<sup>*</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the decomposition of a graph into stars / rank
 
Normal rank

Latest revision as of 09:19, 14 June 2024

scientific article
Language Label Description Also known as
English
Packing and covering of the complete graph with a graph G of four vertices or less
scientific article

    Statements

    Packing and covering of the complete graph with a graph G of four vertices or less (English)
    0 references
    1983
    0 references
    graph packing problem
    0 references
    graph covering problem
    0 references
    0 references

    Identifiers