Rainbow connection number and connected dominating sets (Q2911064): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: On rainbow connection / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hardness and Algorithms for Rainbow Connectivity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Rainbow connection in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3525736 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Asteroidal Triple-Free Graphs / 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: The Complexity of the Partial Order Dimension Problem / rank | |||
Normal rank |
Latest revision as of 15:54, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Rainbow connection number and connected dominating sets |
scientific article |
Statements
Rainbow connection number and connected dominating sets (English)
0 references
12 September 2012
0 references
rainbow connectivity
0 references
rainbow coloring
0 references
connected dominating set
0 references
connected two-step dominating set
0 references
radius
0 references
minimum degree
0 references