Q6072051 (Q6072051): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4269451 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing complete multipartite graphs with 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing \(\lambda\)-fold complete multipartite graphs with 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal packings of \(K_4\)'s into a \(K_n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle decompositions of the line graph of \(K_ n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complete spectrum of 6‐cycle systems of l(k<sub>n</sub>) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle systems of the line graph of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4443249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \(C_5\)-decomposition of the \(\lambda\)-fold line graph of the complete graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multidecompositions of line graphs of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact coverings of 2-paths by 4-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Construction of a perfect set of Euler tours of K2k+1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4239588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group divisible packings and coverings with any minimum leave and minimum excess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5287866 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4325304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4359595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2928590 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum packings and minimum coverings of \(K_{v}\) with octagons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packings and Coverings of the Complete Bipartite Graph by Octagons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3526001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5109056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing pentagons into complete graphs: How clumsy can you get? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing and covering of the complete graph with a graph G of four vertices or less / 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: Decomposition of K//(m,n)(K*//(m,n)) into cycles (circuits) of length 2k / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222136 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kite-group divisible packings and coverings with any minimum leave and minimum excess / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of \(K_{v}\) with certain graphs of five vertices / rank
 
Normal rank

Latest revision as of 16:01, 20 August 2024

scientific article; zbMATH DE number 7771736
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7771736

    Statements

    0 references
    29 November 2023
    0 references
    packing
    0 references
    covering
    0 references
    cycle decomposition
    0 references
    line graph
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers