Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (Q497372): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 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 / zbMATH DE Number | |||
Property / zbMATH DE Number: 6484839 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
decomposition | |||
Property / zbMATH Keywords: decomposition / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete bipartite digraph | |||
Property / zbMATH Keywords: complete bipartite digraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
complete digraph | |||
Property / zbMATH Keywords: complete digraph / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
directed path | |||
Property / zbMATH Keywords: directed path / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
directed cycle | |||
Property / zbMATH Keywords: directed cycle / 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/s00373-014-1442-0 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1977407093 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decomposition of the complete directed graph into k-circuits / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3097395 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3998644 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818315 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Decompositions of a complete multidigraph into nonhamiltonian paths / 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: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Property testing and its connection to learning and approximation / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 19:09, 10 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length |
scientific article |
Statements
Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (English)
0 references
24 September 2015
0 references
decomposition
0 references
complete bipartite digraph
0 references
complete digraph
0 references
directed path
0 references
directed cycle
0 references