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

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Diameter of a Graph and its Complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377651 / rank
 
Normal rank

Revision as of 21:45, 6 July 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