A generalization of orthogonal factorizations in digraphs (Q1705655): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ipl.2017.12.003 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q114167111 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.IPL.2017.12.003 / rank | |||
Normal rank | |||
Latest revision as of 06:00, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A generalization of orthogonal factorizations in digraphs |
scientific article |
Statements
A generalization of orthogonal factorizations in digraphs (English)
0 references
16 March 2018
0 references
combinatorial problems
0 references
digraph
0 references
subdigraph
0 references
\((g,f)\)-factor
0 references
\(k\)-orthogonal factorization
0 references
