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

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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/978-3-319-53007-9_32 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2583793374 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4719318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal factorizations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal (g, f)-factorizations in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal \((g,f)\)-factorizations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomly orthogonal \((g,f)\)-factorizations in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some problems on factorizations with constraints in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orthogonal factorizations in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs with orthogonal factorizations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdigraphs with orthogonal factorizations of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdigraphs with orthogonal factorizations of digraphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4525701 / rank
 
Normal rank

Latest revision as of 16:23, 13 July 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
    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