The domatic number problem on some perfect graph families
type: Item
instance of: scholarly article
title: The domatic number problem on some perfect graph families
zbMATH Open document ID: 0787.68080
DOI: 10.1016/0020-0190(94)90054-X
author: Haim Kaplan
author: Ron Shamir
published in: Information Processing Letters
publication date: 1994-05-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 500514
zbMATH Keywords: chordal graphs
zbMATH Keywords: linear time algorithm
zbMATH Keywords: domatic partition
zbMATH Keywords: totally balanced hypergraphs
zbMATH Keywords: domatic number
zbMATH Keywords: perfect graphs
zbMATH Keywords: bipartite graphs
MaRDI profile type: Publication
cites work: Characterizations of totally balanced matrices
cites work: Balanced matrices
cites work: Dominating sets and domatic number of circular arc graphs
cites work: Characterizations of strongly chordal graphs
cites work: Domination, independent domination, and duality in strongly chordal graphs
cites work: Q4198056
cites work: Some simplified NP-complete graph problems
cites work: The edge inducibility of graphs
cites work: Totally-Balanced and Greedy Matrices
cites work: Doubly Lexical Orderings of Matrices
cites work: Three Partition Refinement Algorithms
cites work: A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
cites work: Linear algorithm for domatic number problem on interval graphs
cites work: Doubly lexical ordering of dense 0--1 matrices
description: scientific article; zbMATH DE number 500514