Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264): Difference between revisions
From MaRDI portal
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
30 January 2018
0 references
total-rainbow path
0 references
total-rainbow connection number
0 references
complementary graph
0 references
Nordhaus-Gaddum-type upper bound
0 references