Abstract
Let P be a finite poset and H ( P ) be the hypergraph whose vertices are the points of P and whose edges are the maximal intervals in P . We study the domatic number d ( G ( P ) ) and the total domatic number d t ( G ( P ) ) of the 2-section graph G ( P ) of H ( P ) . For the subset P l , u of P induced by consecutive levels ∪ i = l u N i of P , we give exact values of d ( G ( P l , u ) ) when P is the chain product C n 1 × C n 2 . According to the values of l , u , n 1 , n 2 , the maximal domatic partition is exhibited. Moreover, we give some exact values or lower bounds for d ( G ( P ∗ Q ) ) and d t ( G ( P l , u ) ) , when ∗ is the direct sum, the linear sum or the Cartesian product. Finally we show that the domatic number and the total domatic number problems in this class of graphs are NP-complete.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
