Independent dominating sets in regular graphs (Q358646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Linear programming and the worst-case analysis of greedy algorithms on cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two relations between the parameters of independence and irredundance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the independent domination number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimum maximal independent sets of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On independent domination number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets in regular graphs / rank
 
Normal rank

Latest revision as of 18:36, 6 July 2024

scientific article
Language Label Description Also known as
English
Independent dominating sets in regular graphs
scientific article

    Statements