Well irredundant graphs
From MaRDI portal
Recommendations
Cites work
- Gallai theorems for graphs, hypergraphs, and set systems
- Graph-theoretic parameters concerning domination, independence, and irredundance
- scientific article; zbMATH DE number 4055676 (Why is no real title available?)
- scientific article; zbMATH DE number 4063149 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 3747181 (Why is no real title available?)
- On graphs having domination number half their order
- Properties of Hereditary Hypergraphs and Middle Graphs
- Some covering concepts in graphs
- Towards a theory of domination in graphs
- Two Bounds for the Domination Number of a Graph
- Well covered simplicial, chordal, and circular arc graphs
- WELL-COVERED GRAPHS: A SURVEY
Cited in
(14)- Graphs with equal domination and covering numbers
- Bipartite theory of irredundant set
- Irredundance
- Graphs with maximal induced matchings of the same size
- scientific article; zbMATH DE number 1208728 (Why is no real title available?)
- scientific article; zbMATH DE number 2061807 (Why is no real title available?)
- scientific article; zbMATH DE number 1792573 (Why is no real title available?)
- Triangulations and equality in the domination chain
- Graphs with coloring redundant edges
- Certified domination
- Irreducible graphs
- A note on -redundant vertices in graphs
- Recognizing well-dominated graphs is coNP-complete
- Generating minimal redundant and maximal irredundant subhypergraphs
This page was built for publication: Well irredundant graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1917235)
