Finding a Domatic Partition of an Interval Graph in Time O(n)

DOI10.1137/0409015zbMATH Open0846.68048OpenAlexW1993974777MaRDI QIDQ4881283FDOQ4881283

Authors: Glenn K. Manacher, Terrance A. Mankus 

Publication date: 22 September 1996

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0409015

Recommendations

• On the domatic number of interval graphs
• The Domatic Number Problem in Interval Graphs
• Linear algorithm for domatic number problem on interval graphs
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model
• The domatic number problem on some perfect graph families

zbMATH Keywords

domatic numberdomatic partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical methods for integral transforms (65R10)

Cited In (7)

• The domatic number problem on some perfect graph families
• On the domatic number of interval graphs
• Constrained domatic bipartition on trees
• The upper domatic number of a graph
• Loose cover of graphs
• The Domatic Number Problem in Interval Graphs
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model

This page was built for publication: Finding a Domatic Partition of an Interval Graph in Time $O(n)$

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4881283)