Note on minimally \(d\)-rainbow connected graphs (Q742605): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1203.3030 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The minimum size of \(k\)-rainbow connected graphs of given order / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the minimum number of edges of two-connected graphs with given diameter / 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 minimally rainbow \(k\)-connected graphs / rank | |||
Normal rank | |||
Latest revision as of 02:13, 9 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Note on minimally \(d\)-rainbow connected graphs |
scientific article |
Statements
Note on minimally \(d\)-rainbow connected graphs (English)
0 references
19 September 2014
0 references
edge-coloring
0 references
\(d\)-rainbow connected
0 references
rainbow connection number
0 references
minimum size
0 references
