Pages that link to "Item:Q5749323"
From MaRDI portal
The following pages link to The Domatic Number Problem in Interval Graphs (Q5749323):
Displaying 12 items.
- Loose cover of graphs (Q626957) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← 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)
- The domatic number problem (Q1322260) (← links)
- Edge domatic numbers of complete \(n\)-partite graphs (Q1340123) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
- The upper domatic number of a graph (Q5154570) (← links)
- Domatically perfect graphs (Q5154583) (← links)
- Domatically full Cartesian product graphs (Q5876780) (← links)
- A resource assignment problem on graphs (Q6487990) (← links)
