Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (Q397162): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C60 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6328306 / rank
 
Normal rank
Property / zbMATH Keywords
 
resolvable graph decomposition
Property / zbMATH Keywords: resolvable graph decomposition / rank
 
Normal rank
Property / zbMATH Keywords
 
uniform resolution
Property / zbMATH Keywords: uniform resolution / rank
 
Normal rank
Property / zbMATH Keywords
 
3-path
Property / zbMATH Keywords: 3-path / rank
 
Normal rank
Property / zbMATH Keywords
 
3-cycle
Property / zbMATH Keywords: 3-cycle / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2151689454 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1312.2113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of resolvable path designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On resolvable mixed path designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipartite 2-factorizations of kn − I and the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3411976 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum uniformly resolvable designs with block sizes 2 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of uniformly resolvable decompositions of \(K_v\) and \(K_v-I\) into paths and kites / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decompositions, handcuffed prisoners and balanced p-designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolvable path designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2848736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5661892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly resolvable pairwise balanced designs with blocksizes two and three / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small Uniformly Resolvable Designs for Block Sizes 3 and 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniformly resolvable designs with block sizes 3 and 4 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:48, 8 July 2024

scientific article
Language Label Description Also known as
English
Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs
scientific article

    Statements

    Uniformly resolvable decompositions of \(K_v\) into \(P_3\) and \(K_3\) graphs (English)
    0 references
    0 references
    0 references
    8 August 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    resolvable graph decomposition
    0 references
    uniform resolution
    0 references
    3-path
    0 references
    3-cycle
    0 references
    0 references
    0 references