Constrained domatic bipartition on trees (Q1751203): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3291034 / 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: Optimal shift partitioning of pharmacies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constrained domatic bipartition on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear algorithm for the domination number of a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Domatic Partition of an Interval Graph in Time $O(n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domatic Partition on Several Classes of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal shift coloring of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domatic number problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank

Revision as of 16:07, 15 July 2024

scientific article
Language Label Description Also known as
English
Constrained domatic bipartition on trees
scientific article

    Statements

    Constrained domatic bipartition on trees (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    dominating set
    0 references
    cardinality constraint
    0 references
    tree
    0 references
    polynomial-time algorithm
    0 references
    integral polytope
    0 references

    Identifiers

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