Domatic partitions of computable graphs (Q2436619): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Effective coloration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reverse Mathematics and Recursive Graph Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian paths in infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite versions of some problems from finite complexity theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the exact domatic number problem and of the exact conveyor flow shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663328 / rank
 
Normal rank

Latest revision as of 09:14, 7 July 2024

scientific article
Language Label Description Also known as
English
Domatic partitions of computable graphs
scientific article

    Statements

    Domatic partitions of computable graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 February 2014
    0 references
    computability theory
    0 references
    computable graph theory
    0 references
    domatic number
    0 references
    dominating set
    0 references
    reverse mathematics
    0 references

    Identifiers

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