The upper domatic number of a graph
From MaRDI portal
Publication:5154570
Recommendations
Cites work
- A simple linear time algorithm for the domatic partition problem on strongly chordal graphs
- Finding a Domatic Partition of an Interval Graph in Time $O(n)$
- scientific article; zbMATH DE number 3933124 (Why is no real title available?)
- scientific article; zbMATH DE number 3663191 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Linear algorithm for domatic number problem on interval graphs
- On k-domatic numbers of graphs
- The algorithmic complexity of domination digraphs
- The domatic number problem
- The Domatic Number Problem in Interval Graphs
- The transitivity of a graph
- Towards a theory of domination in graphs
Cited in
(18)- Upper majority domination number of a graph
- Transitivity on subclasses of bipartite graphs
- Upper double monophonic number of a graph
- The transitivity of a graph
- scientific article; zbMATH DE number 6145156 (Why is no real title available?)
- New results on upper domatic number of graphs
- The upper domatic number of powers of graphs
- Upper domatic number of regular graphs
- The transitivity of special graph classes
- Transitivity on subclasses of chordal graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- Algorithmic study on 2-transitivity of graphs
- Independent coalition in graphs: existence and characterization
- On complementarily transitivity of graphs
- The total upper domatic number of a graph
- Tournament transitivity of graphs
- Transitivity in some graph-classes
- Strong transitivity of a graph
This page was built for publication: The upper domatic number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5154570)