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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q128048661, #quickstatements; #temporary_batch_1722428282777
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2298/aadm170315009g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2939392755 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128048661 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:31, 31 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