Edge domatic numbers of complete \(n\)-partite graphs (Q1340123): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the domatic number of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets and domatic number of circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Domatic Number Problem in Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3870917 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear algorithm for domatic number problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-domatic number of a graph / rank
 
Normal rank

Latest revision as of 10:50, 23 May 2024

scientific article
Language Label Description Also known as
English
Edge domatic numbers of complete \(n\)-partite graphs
scientific article

    Statements

    Edge domatic numbers of complete \(n\)-partite graphs (English)
    0 references
    0 references
    0 references
    11 December 1994
    0 references
    edge dominating set
    0 references
    edge domatic partition
    0 references
    edge domatic number
    0 references
    complete \(n\)-partite graphs
    0 references

    Identifiers