Graphs with vertex rainbow connection number two (Q498122): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph / 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: Graphs with rainbow connection number two / 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: Rainbow connection number of dense 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 connections of graphs: a survey / rank
 
Normal rank

Latest revision as of 20:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Graphs with vertex rainbow connection number two
scientific article

    Statements