Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2015.10.020 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2195278227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number and radius / 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 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: Rainbow connection number, bridges and radius / rank
 
Normal rank
Property / cites work
 
Property / cites work: The rainbow connection number of 2-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection and forbidden subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 / 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 of graphs with diameter 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rainbow connection number of dense 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: Rainbow Connection in Graphs with Minimum Degree Three / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:53, 11 July 2024

scientific article
Language Label Description Also known as
English
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2
scientific article

    Statements

    Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    rainbow connection
    0 references
    edge coloring
    0 references
    forbidden subgraphs
    0 references
    0 references