On the domatic number of internal graphs
- 29 August 1988
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 28 (6) , 275-280
- https://doi.org/10.1016/0020-0190(88)90173-1
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Some parallel algorithms on interval graphsDiscrete Applied Mathematics, 1987
- Total domination in interval graphsInformation Processing Letters, 1986
- Dominating sets and domatic number of circular arc graphsDiscrete Applied Mathematics, 1985
- Finding Hamiltonian circuits in interval graphsInformation Processing Letters, 1985
- An O(n log n) algorithm for the convex bipartite matching problemOperations Research Letters, 1984
- Finding Hamiltonian circuits in proper interval graphsInformation Processing Letters, 1983
- Efficient algorithms for interval graphs and circular‐arc graphsNetworks, 1982
- Dominating Sets in Chordal GraphsSIAM Journal on Computing, 1982
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithmsJournal of Computer and System Sciences, 1976
- Optimal domination in graphsIEEE Transactions on Circuits and Systems, 1975