Disjoint independent dominating sets in graphs (Q1240740): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of labeled k-dimensional trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general class of invulnerable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On uniquely colorable planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4060985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5677502 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely colorable graphs / rank
 
Normal rank

Revision as of 22:03, 12 June 2024

scientific article
Language Label Description Also known as
English
Disjoint independent dominating sets in graphs
scientific article

    Statements