The complexity of determining the vertex-rainbow index of graphs (Q2788724): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solutions to conjectures on the (<i>k</i> ,ℓ)-rainbow index of complete graphs / 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 Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow trees in graphs and generalized connectivity / 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: Q5692514 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3514991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the hardness of rainbow connections for planar and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented diameter and rainbow connection number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections for outerplanar graphs with diameter 2 and 3 / 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: Note on minimally \(d\)-rainbow connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong rainbow vertex-connection of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connections of graphs: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterize graphs with rainbow connection number $m-2$ and $m-3$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vertex-rainbow index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On rainbow total-coloring of a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s1793830915500470 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1702314990 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:01, 30 July 2024

scientific article
Language Label Description Also known as
English
The complexity of determining the vertex-rainbow index of graphs
scientific article

    Statements

    The complexity of determining the vertex-rainbow index of graphs (English)
    0 references
    0 references
    0 references
    22 February 2016
    0 references
    vertex-coloring
    0 references
    vertex-rainbow \(S\)-tree
    0 references
    \(k\)-vertex rainbow index
    0 references
    computational complexity
    0 references

    Identifiers

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