Pages that link to "Item:Q1262139"

The following pages link to Linear algorithm for domatic number problem on interval graphs (Q1262139):

Displaying 17 items.

• Loose cover of graphs (Q626957) (← links)
• Linear algorithm for optimal path cover problem on interval graphs (Q911770) (← 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)
• On finding the minimum bandwidth of interval graphs (Q1183610) (← 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)
• Generalized vertex covering in interval graphs (Q1199467) (← links)
• The domatic number problem on some perfect graph families (Q1313715) (← links)
• Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
• Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
• Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
• Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs (Q1917245) (← links)
• Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
• Common extremal graphs for three inequalities involving domination parameters (Q5134523) (← links)
• The upper domatic number of a graph (Q5154570) (← links)
• A resource assignment problem on graphs (Q6487990) (← links)