Completion and decomposition of hypergraphs into dominating sets of graphs (Q322230): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Mercè Mora / rank
Normal rank
 
Property / author
 
Property / author: José Luis Ruiz / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2217158496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Neighborhood hypergraphs of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for min independent dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal dominating sets in graph classes: combinatorial bounds and enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial bounds via measure and conquer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent domination in graphs: A survey and recent results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Enumeration of Minimal Dominating Sets and Related Notions / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:25, 12 July 2024

scientific article
Language Label Description Also known as
English
Completion and decomposition of hypergraphs into dominating sets of graphs
scientific article

    Statements

    Identifiers