scholarly journals Upper domatic number of regular graphs

2021 ◽  
Vol 8 ◽  
pp. 16-21
10.37236/5089 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Matthew Jura ◽  
Oscar Levin ◽  
Tyler Markkanen

We investigate the apparent difficulty of finding domatic partitions in graphs using tools from computability theory.  We consider nicely presented (i.e., computable) infinite graphs and show that even if the domatic number is known, there might not be any algorithm for producing a domatic partition of optimal size.  However, we prove that smaller domatic partitions can be constructed if we restrict to regular graphs.  Additionally, we establish similar results for total domatic partitions.


2009 ◽  
Vol 157 (8) ◽  
pp. 1905-1912 ◽  
Author(s):  
Dirk Meierling ◽  
Lutz Volkmann ◽  
Stephan Zitzen

2016 ◽  
Vol 508 ◽  
pp. 133-145 ◽  
Author(s):  
V. Nikiforov
Keyword(s):  

2021 ◽  
Author(s):  
Daniel Horsley ◽  
Adam Mammoliti
Keyword(s):  

2021 ◽  
Vol 344 (6) ◽  
pp. 112343
Author(s):  
E. Abajo ◽  
M. Bendala
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document