Upper bounds for the rainbow connection numbers of line graphs (Q1926059): 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: 1001.0287 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5422499 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On rainbow connection / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rainbow connection in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5668506 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The rainbow connection of a graph is (at most) reciprocal to its minimum degree / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Clique coverings and partitions of line graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3166468 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Rainbow Connection in Graphs with Minimum Degree Three / rank | |||
Normal rank | |||
Latest revision as of 01:09, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Upper bounds for the rainbow connection numbers of line graphs |
scientific article |
Statements
Upper bounds for the rainbow connection numbers of line graphs (English)
0 references
27 December 2012
0 references
rainbow path
0 references
rainbow connection number
0 references
iterated line graph
0 references
edge-disjoint triangles
0 references
