On the domatic number of interval graphs
From MaRDI portal
Publication:1111388
DOI10.1016/0020-0190(88)90173-1zbMath0658.68077OpenAlexW1991307540MaRDI QIDQ1111388
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90173-1
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (11)
Edge domatic numbers of complete \(n\)-partite graphs ⋮ Deferred-query—An efficient approach for problems on interval and circular-arc graphs ⋮ Weighted independent perfect domination on cocomparability graphs ⋮ Finding domatic partitions in infinite graphs ⋮ Loose cover of graphs ⋮ Connected domination and Steiner set on weighted permutation graphs ⋮ A simple linear time algorithm for the domatic partition problem on strongly chordal graphs ⋮ An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model ⋮ A tight bound on the number of mobile servers to guarantee transferability among dominating configurations ⋮ Linear algorithm for domatic number problem on interval graphs ⋮ The domatic number problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An 0(n log n) algorithm for the convex bipartite matching problem
- Finding Hamiltonian circuits in proper interval graphs
- Finding Hamiltonian circuits in interval graphs
- Dominating sets and domatic number of circular arc graphs
- Some parallel algorithms on interval graphs
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- Total Domination and Irredundance in Weighted Interval Graphs
- Dominating Sets in Chordal Graphs
- Efficient algorithms for interval graphs and circular-arc graphs
- Total domination in interval graphs
This page was built for publication: On the domatic number of interval graphs
