Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs (Q2971666): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1753363
Property / author
 
Property / author: Si-zhong Zhou / rank
Normal rank
 

Revision as of 10:50, 29 February 2024

scientific article
Language Label Description Also known as
English
Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs
scientific article

    Statements

    Subgraphs with Orthogonal $$[0,k_{i}]_{1}^{n}$$ [ 0 , k i ] 1 n -Factorizations in Graphs (English)
    0 references
    0 references
    0 references
    7 April 2017
    0 references
    subgraph
    0 references
    factor
    0 references
    \([0, k_i]_1^{m}\)-factorization
    0 references
    orthogonal
    0 references

    Identifiers