The upper domatic number of a graph (Q5154570): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Towards a theory of domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The domatic number problem / 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: Finding a Domatic Partition of an Interval Graph in Time $O(n)$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear time algorithm for the domatic partition problem on strongly chordal graphs / 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: On $k$-domatic numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3861441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3708055 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4566231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2895354 / rank
 
Normal rank

Revision as of 19:19, 26 July 2024

scientific article; zbMATH DE number 7406343
Language Label Description Also known as
English
The upper domatic number of a graph
scientific article; zbMATH DE number 7406343

    Statements