Nordhaus-Gaddum-type theorem for rainbow connection number of graphs (Q367076): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C15 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6211664 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
edge-colored graph | |||
| Property / zbMATH Keywords: edge-colored graph / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
rainbow connection number | |||
| Property / zbMATH Keywords: rainbow connection number / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
Nordhaus-Gaddum-type | |||
| Property / zbMATH Keywords: Nordhaus-Gaddum-type / rank | |||
Normal rank | |||
Revision as of 11:54, 28 June 2023
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
26 September 2013
0 references
edge-colored graph
0 references
rainbow connection number
0 references
Nordhaus-Gaddum-type
0 references
