Linear algorithm for domatic number problem on interval graphs (Q1262139): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: On the domatic number of interval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Dominating sets and domatic number of circular arc graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4198056 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding Hamiltonian circuits in interval graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A unified approach to domination problems on interval graphs / rank | |||
Normal rank | |||
Latest revision as of 10:30, 20 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Linear algorithm for domatic number problem on interval graphs |
scientific article |
Statements
Linear algorithm for domatic number problem on interval graphs (English)
0 references
1989
0 references
The authors present a linear algorithm which computes the domatic number of an interval graph. This improves previous results of \textit{A. A. Bertossi} [Inf. Process. Lett. 28, No.6, 275-280 (1988; Zbl 0658.68077)].
0 references
linear algorithm
0 references
domatic number
0 references
interval graph
0 references
