On k-domatic numbers of graphs
From MaRDI portal
Publication:3322141
Recommendations
Cites work
Cited in
(22)- The \(k\)-domatic number of a graph
- scientific article; zbMATH DE number 7456252 (Why is no real title available?)
- The Roman domatic problem in graphs and digraphs: a survey
- Transitivity on subclasses of bipartite graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- scientific article; zbMATH DE number 5913 (Why is no real title available?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A characterization of graphs with regular distance-2 graphs
- scientific article; zbMATH DE number 1124604 (Why is no real title available?)
- Bibliography on domination in graphs and some basic definitions of domination parameters
- On connected k-domination numbers of graphs.
- The upper domatic number of a graph
- scientific article; zbMATH DE number 2077664 (Why is no real title available?)
- On \(k\)-dimensional graphs and their bases
- On the \(\{k\}\)-domatic number of graphs
- Algorithmic study on 2-transitivity of graphs
- scientific article; zbMATH DE number 3970788 (Why is no real title available?)
- Distance domination in graphs
- scientific article; zbMATH DE number 4091561 (Why is no real title available?)
- On the \(k\)-domination number of digraphs
- scientific article; zbMATH DE number 434495 (Why is no real title available?)
- scientific article; zbMATH DE number 90561 (Why is no real title available?)
This page was built for publication: On $k$-domatic numbers of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322141)