A class of threshold and domishold graphs: Equistable and equidominating graphs
From MaRDI portal
(Redirected from Publication:795059)
Recommendations
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Equivalence dominating sets in graphs
- Equivalence domination in graphs
- On \(k\)-equivalence domination in graphs
- On some independent equitable domination of graphs
- On graphs with equal total domination and Grundy total domination numbers
- Characterization of some classes of graphs with equal domination number and isolate domination number
- On graphs with equal domination and connected domination numbers
- On graphs with equal total domination and connected domination numbers
Cites work
- scientific article; zbMATH DE number 3487492 (Why is no real title available?)
- scientific article; zbMATH DE number 3598234 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- A Note on "The Comparability Graph of a Tree"
- Linear Separation of Dominating Sets in Graphs
Cited in
(24)- Short proofs on the structure of general partition, equistable and triangle graphs
- Strong cliques and equistability of EPT graphs
- Equistarable bipartite graphs
- On equistable, split, CIS, and related classes of graphs
- Threshold graphs, shifted complexes, and graphical complexes
- scientific article; zbMATH DE number 4127265 (Why is no real title available?)
- Complexity results for equistable graphs and related classes
- Linear separation of connected dominating sets in graphs
- Strong cliques in diamond-free graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Complement reducible graphs
- Equistable series-parallel graphs
- Equistable chordal graphs
- Graphs obtained by disjoint unions and joins of cliques and stable sets
- Recognizing \(k\)-equistable graphs in FPT time
- Equistarable graphs and counterexamples to three conjectures on equistable graphs
- Computing well-covered vector spaces of graphs using modular decomposition
- Equistable graphs, general partition graphs, triangle graphs, and graph products
- Equistable simplicial, very well-covered, and line graphs
- Equistable distance-hereditary graphs
- Decomposing 1-Sperner hypergraphs
- Total domishold graphs: a generalization of threshold graphs, with connections to threshold hypergraphs
- Polytope Des Absorbants Dans Une Classe De Graphe a Seuil
- On a class of graphs between threshold and total domishold graphs
This page was built for publication: A class of threshold and domishold graphs: Equistable and equidominating graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q795059)