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

DOI10.1137/0409015zbMath0846.68048OpenAlexW1993974777MaRDI QIDQ4881283

Terrance A. Mankus, Glenn K. Manacher

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)

Related Items (3)

Loose cover of graphs ⋮ The upper domatic number of a graph ⋮ Constrained domatic bipartition on trees

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