The binding number of almost every graph
(1991)
Presentation / Conference Contribution
All Outputs (4)
A characterization of domination perfect graphs (1991)
Journal Article
Let γ(G) and i(G) be the domination number and independent domination number of a graph G, respectively. Sumner and Moore [8] define a graph G to be domination perfect if γ(H) = i(H), for every induced subgraph H of G. In this article, we give a fini... Read More about A characterization of domination perfect graphs.
A characterization of perfect dominating-clique graphs (1991)
Journal Article
A note on domatically critical and cocritical graphs (1991)
Journal Article