Dominating sets and domatic number of circular arc graphs
From MaRDI portal
Publication:1066921
DOI10.1016/0166-218X(85)90025-3zbMath0579.05051MaRDI QIDQ1066921
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C99: Graph theory
Related Items
Representations of graphs and networks (coding, layouts and embeddings), Linear time algorithms on circular-arc graphs, An optimal algorithm for finding dominating cycles in circular-arc graphs, A simple linear time algorithm for the domatic partition problem on strongly chordal graphs, An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model, Efficient parallel recognition of some circular arc graphs. I, Paths in interval graphs and circular arc graphs, The domatic number problem on some perfect graph families, The domatic number problem, Edge domatic numbers of complete \(n\)-partite graphs, One-node cutsets and the dominating set polytope, Transversal partitioning in balanced hypergraphs, Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs