Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W2000391936 / rank
 
Normal rank

Revision as of 18:34, 19 March 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
scientific article

    Statements

    Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    26 September 2013
    0 references
    edge-colored graph
    0 references
    rainbow connection number
    0 references
    Nordhaus-Gaddum-type
    0 references

    Identifiers