Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles (Q2471062): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Decomposing the complete graph into cycles of many lengths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4399766 / 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: On Alspach's conjecture / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4842729 / 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 |
Latest revision as of 16:06, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles |
scientific article |
Statements
Decomposition of \(K_{m, n}\) into 4-cycles and \(2t\)-cycles (English)
0 references
18 February 2008
0 references
complete bipartite graph
0 references
cycle decomposition
0 references