On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset

DOI10.1016/j.disc.2008.01.034zbMath1211.05088OpenAlexW2175105019MaRDI QIDQ1025567

Saliha Ouatiki, Isma Bouchemakh

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.034

zbMATH Keywords

intervalposetchainCartesian productNP-completedomatic numberorder-interval hypergraphtotal domatic number

Mathematics Subject Classification ID

Partial orders, general (06A06) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Domatically full Cartesian product graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dominating sets and domatic number of circular arc graphs
• Sur le nombre domatique du n-cube et une conjecture de Zelinka. (On the domatic number of the n-cube and a conjecture of Zelinka)
• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
• Linear algorithm for domatic number problem on interval graphs
• The domatic number problem on some perfect graph families
• The domatic number problem
• The order-interval hypergraph of a finite poset and the König property
• Interval stability and interval covering property in finite posets
• Interval Packing and Covering in the Boolean Lattice
• Towards a theory of domination in graphs

This page was built for publication: On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset