The Domatic Number Problem in Interval Graphs
From MaRDI portal
Publication:5749323
DOI10.1137/0403045zbMath0718.05046OpenAlexW2006107780MaRDI QIDQ5749323
Tung-Lin Lu, Gerard Jennhwa Chang, Pei-Hsin Ho
Publication date: 1990
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/563a79a36b22a5cfa1c82daa81c5dcc473af3094
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
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, Loose cover of graphs, The upper domatic number of a graph, Domatically perfect 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, The domatic number problem, Domatically full Cartesian product graphs
