On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (Q3633008): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.20356 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4253679109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost‐regular factorization of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs—a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3791187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sufficient condition for equitable edge-colourings of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semiregular factorization of simple graphs / rank
 
Normal rank

Latest revision as of 15:43, 1 July 2024

scientific article
Language Label Description Also known as
English
On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph
scientific article

    Statements

    On the number of (<i>r,r</i>+1)- factors in an (<i>r,r</i>+1)-factorization of a simple graph (English)
    0 references
    16 June 2009
    0 references
    factors
    0 references
    factorizations
    0 references
    (\(r, r+1\))-factorizations
    0 references
    simple graphs
    0 references
    semiregular factorizations
    0 references

    Identifiers