Acyclic total dominating sets in cubic graphs (Q5028796): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Some remarks on domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint independent dominating sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Graphs, with an Application to a Problem of Traffic Control / rank
 
Normal rank
Property / cites work
 
Property / cites work: On disjoint maximal independent sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of connected dominating sets and total dominating sets with specified induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic domination on bipartite permutation graphs / rank
 
Normal rank

Revision as of 23:24, 27 July 2024

scientific article; zbMATH DE number 7472198
Language Label Description Also known as
English
Acyclic total dominating sets in cubic graphs
scientific article; zbMATH DE number 7472198

    Statements

    Identifiers