Dominating sets and domatic number of circular arc graphs
From MaRDI portal
Publication:1066921
DOI10.1016/0166-218X(85)90025-3zbMath0579.05051OpenAlexW2143180579MaRDI QIDQ1066921
Publication date: 1985
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(85)90025-3
Related Items (24)
Edge domatic numbers of complete \(n\)-partite graphs ⋮ An improved exact algorithm for the domatic number problem ⋮ Paired domination on interval and circular-arc graphs ⋮ One-node cutsets and the dominating set polytope ⋮ On the domatic number of interval graphs ⋮ Transversal partitioning in balanced hypergraphs ⋮ Efficient approximation algorithms for domatic partition and on-line coloring of circular arc graphs ⋮ The \(p\)-Maxian problem on interval graphs ⋮ Loose cover of graphs ⋮ 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 ⋮ Common extremal graphs for three inequalities involving domination parameters ⋮ Linear algorithm for domatic number problem on interval graphs ⋮ On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset ⋮ Dominating sets for split and bipartite graphs ⋮ Efficient reduction for path problems on circular-arc graphs ⋮ The domatic number problem on some perfect graph families ⋮ Bibliography on domination in graphs and some basic definitions of domination parameters ⋮ The domatic number problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On domination and independent domination numbers of a graph
- Domination, independent domination, and duality in strongly chordal graphs
- Contributions to the theory of domination, independence and irredundance in graphs
- A linear algorithm for the domination number of a tree
- Disjoint independent dominating sets in graphs
- Minimum node disjoint path covering for circular-arc graphs
- A linear algorithm for the domination number of a series-parallel graph
- Graph-theoretic parameters concerning domination, independence, and irredundance
- On a routing problem
- Domination in permutation graphs
- An Optimal Solution for the Channel-Assignment Problem
- Total domination in graphs
- An Efficient Test for Circular-Arc Graphs
- Dominating Sets in Chordal Graphs
- An $O(n^2 )$ Algorithm for Coloring Proper Circular Arc Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Algorithms on circular-arc graphs
- Coloring a Family of Circular Arcs
- R -Domination in Graphs
- Towards a theory of domination in graphs
- Construction of TernaryHv-groups and TernaryP-hyperoperations
This page was built for publication: Dominating sets and domatic number of circular arc graphs
