Counting dominating sets and related structures in graphs (Q271644): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The number of fixed points of the majority rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Errata to: The number of fixed points of the majority rule / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some intersection theorems for ordered sets and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on the maximum number of minimum dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On weighted graph homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Entropy Approach to the Hard-Core Model on Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the greatest number of 2 and 3 colorings of a (v, e)-graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Legal coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing the number of <i>q</i> -colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing proper colorings on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backtrack: An O(1) expected time algorithm for the graph coloring problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Number of Independent Sets in a Regular Graph / rank
 
Normal rank

Revision as of 17:49, 11 July 2024

scientific article
Language Label Description Also known as
English
Counting dominating sets and related structures in graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references