Upper bounds for the total rainbow connection of graphs (Q328717): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Hui Jiang / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
Normal rank
 
Property / author
 
Property / author: Xue Liang Li / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2020227506 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1501.01806 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / 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: Hardness and algorithms for rainbow connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further hardness results on the rainbow vertex-connection number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of determining the rainbow vertex-connection of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees in graphs of minimum degree 4 or 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning Trees with Many Leaves / 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: On the rainbow vertex-connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total rainbow \(k\)-connection in graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:17, 12 July 2024

scientific article
Language Label Description Also known as
English
Upper bounds for the total rainbow connection of graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references