On k-domatic numbers of graphs
From MaRDI portal
Publication:3322141
DOI10.21136/CMJ.1983.101879zbMATH Open0537.05050OpenAlexW2724951559MaRDI QIDQ3322141FDOQ3322141
Authors: Bohdan Zelinka
Publication date: 1983
Full work available at URL: https://eudml.org/doc/13384
Recommendations
Cites Work
Cited In (22)
- Title not available (Why is that?)
- The Roman domatic problem in graphs and digraphs: a survey
- Transitivity on subclasses of bipartite graphs
- Algorithmic study of \(d_2\)-transitivity of graphs
- Title not available (Why is that?)
- \(k\)-domination and \(k\)-independence in graphs: A survey
- A characterization of graphs with regular distance-2 graphs
- Title not available (Why is that?)
- On connected \(k\)-domination numbers of graphs.
- Bibliography on domination in graphs and some basic definitions of domination parameters
- The upper domatic number of a graph
- Title not available (Why is that?)
- Algorithmic study on 2-transitivity of graphs
- On the \(\{k\}\)-domatic number of graphs
- On \(k\)-dimensional graphs and their bases
- Title not available (Why is that?)
- Distance domination in graphs
- Title not available (Why is that?)
- On the \(k\)-domination number of digraphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The \(k\)-domatic number of a graph
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)