Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (Q2911051)

From MaRDI portal
Revision as of 20:12, 3 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring
scientific article

    Statements

    title
    Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring (English)
    0 references
    author
    Q200923
    0 references
    Q178710
    0 references
    publication date
    12 September 2012
    0 references
    zbMATH Keywords
    equitable coloring
    0 references
    maximum degree
    0 references

    Identifiers

    DOI
    10.1002/jgt.20630
    0 references
    zbMATH DE Number
    6081427
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2911051&oldid=15877516"
    Powered by MediaWiki