Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (Q2471048): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Cycle decompositions of \(K_n\) and \(K_n-I\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Even cycle decompositions of complete graphs minus a 1‐factor / 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: Q4526648 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4026150 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Packing pentagons into complete graphs: How clumsy can you get? / rank | |||
Normal rank |
Latest revision as of 17:06, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) |
scientific article |
Statements
Packing 5-cycles into balanced complete \(m\)-partite graphs for odd \(m\) (English)
0 references
18 February 2008
0 references
5-cycle
0 references
Packing
0 references
Leave
0 references
Decomposition
0 references