Pages that link to "Item:Q1111388"

The following pages link to On the domatic number of interval graphs (Q1111388):

Displaying 21 items.

• On counting interval lengths of interval graphs (Q531590) (← links)
• Loose cover of graphs (Q626957) (← links)
• Finding domatic partitions in infinite graphs (Q888598) (← links)
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
• On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset (Q1025567) (← links)
• Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
• Connected domination and Steiner set on weighted permutation graphs (Q1190520) (← links)
• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) (← links)
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) (← links)
• Linear algorithm for domatic number problem on interval graphs (Q1262139) (← links)
• The domatic number problem (Q1322260) (← links)
• Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
• The \(k\)-neighbor, \(r\)-domination problems on interval graphs (Q1342074) (← links)
• Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
• On the \(\Delta \)-interval and the \(\Delta \)-convexity numbers of graphs and graph products (Q2161271) (← links)
• On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
• (Q4337507) (← links)
• The Total Interval Number of a Graph II: Trees and Complexity (Q4881297) (← links)
• (Q4882972) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• A resource assignment problem on graphs (Q6487990) (← links)