Domination in Kneser graphs
From MaRDI portal
Publication:5287908
DOI10.21136/MB.1993.126050zbMATH Open0778.05043OpenAlexW3048030522MaRDI QIDQ5287908FDOQ5287908
Jaroslav Ivančo, Bohdan Zelinka
Publication date: 8 August 1993
Full work available at URL: https://eudml.org/doc/29204
Recommendations
- Domination in Kn\"odel Graphs
- scientific article; zbMATH DE number 1161328
- Bounds on the domination number of Kneser graphs
- scientific article; zbMATH DE number 6863591
- Domination in graphs
- scientific article; zbMATH DE number 1342030
- Domination in Graphs
- On Domination in Graphs
- \((k,r)\)-domination in graphs
- On the total \(k\)-domination in graphs
Cited In (8)
- Grundy domination and zero forcing in Kneser graphs
- Efficient domination in knights graphs
- On $k$-domatic numbers of graphs
- \((k,r)\)-domination in graphs
- The domination complexity and related extremal values of large 3D torus
- Total domination in cubic Knodel graphs
- Title not available (Why is that?)
- Total dominator chromatic number of Kneser graphs
This page was built for publication: Domination in Kneser graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5287908)
