Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (Q2311707): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Yu-feng Gao / rank
Normal rank
 
Property / author
 
Property / author: Yan Xun Chang / rank
Normal rank
 
Property / author
 
Property / author: Yu-feng Gao / rank
 
Normal rank
Property / author
 
Property / author: Yan Xun Chang / rank
 
Normal rank
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.1007/s10114-019-8005-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2941501768 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the existence of<i>G</i>-Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269451 / 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: Maximum packings of uniform group divisible triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing paths in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing cycles in complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum embedding of P3-designs into (K4?e)-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing the spectrum of packings and coverings for the complete graph with stars with up to five edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Group Divisible Covering Designs with Block Size 4: A Type of Covering Array with Row Limit / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum packings of \(K_ n\) with copies of \(K_ 4-e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple minimum coverings of \(K_n\) with copies of \(K_4 -e\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal coverings of pairs by triples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum packings of the complete graph with uniform length cycles / 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: On group divisible covering designs / 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: Q4934837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cyclic 4-cycle packings of the complete multipartite graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:39, 19 July 2024

scientific article
Language Label Description Also known as
English
Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs
scientific article

    Statements

    Simple minimum (\(K_4 - e\))-coverings of complete multipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    4 July 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    group divisible covering
    0 references
    (\(K_4 - e\))-covering
    0 references
    excess graph
    0 references
    0 references