Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (Q2819511)

From MaRDI portal
Revision as of 14:52, 12 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
scientific article

    Statements

    title
    Linear Time Algorithms for Happy Vertex Coloring Problems for Trees (English)
    0 references
    author
    N. R. Aravind
    0 references
    Anjeneya Swami Kare
    0 references
    publication date
    29 September 2016
    0 references
    zbMATH Keywords
    happy vertex
    0 references
    happy edge
    0 references
    graph coloring
    0 references
    coloring trees
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    05C05
    0 references
    05C15
    0 references
    05C85
    0 references
    68W40
    0 references
    zbMATH DE Number
    6631028
    0 references
    OpenAlex ID
    W2531766656
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2819511&oldid=36275777"
    Powered by MediaWiki