Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4014618 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of Nordhaus-Gaddum type relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type theorem for rainbow connection number of 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: Proper connection numbers of complementary graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection of graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type results for the generalized edge-connectivity of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total rainbow \(k\)-connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total rainbow connection number and complementary graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow total-coloring of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3377651 / rank
 
Normal rank

Latest revision as of 01:33, 15 July 2024

scientific article
Language Label Description Also known as
English
Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs
scientific article

    Statements

    Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 January 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    total-rainbow path
    0 references
    total-rainbow connection number
    0 references
    complementary graph
    0 references
    Nordhaus-Gaddum-type upper bound
    0 references
    0 references
    0 references