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

DOI10.1137/0409015MaRDI QIDQ4881283zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

domatic numberdomatic partition

Mathematics Subject Classification ID

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

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

Cited in

(7)

• 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
• The upper domatic number of a graph
• On the domatic number of interval graphs
• The domatic number problem on some perfect graph families
• Constrained domatic bipartition on trees

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)