A note on an induced subgraph characterization of domination perfect graphs

DOI10.1016/J.DAM.2016.09.040MaRDI QIDQ516908zbMATH OpenOpenAlexFDO

Authors Eglantine Camby, Fränk Plein

Publication date 15 March 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.09.040

zbMATH Keywords

dominationforbidden induced subgraphsindependent domination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• A note on the characterization of domination perfect graphs
• An induced subgraph characterization of domination perfect graphs
• Perfect graphs for domination games
• A characterization of domination perfect graphs
• \(i\gamma(1)\)-perfect graphs

Cites work

• A characterization of \(\Gamma\alpha(k)\)-perfect graphs
• A characterization of domination perfect graphs
• A linear algorithm for the domination number of a tree
• A note on the characterization of domination perfect graphs
• An induced subgraph characterization of domination perfect graphs
• Construction of trees and graphs with equal domination parameters
• Critical concepts in domination
• scientific article; zbMATH DE number 3648727 (Why is no real title available?)
• scientific article; zbMATH DE number 3159208 (Why is no real title available?)
• scientific article; zbMATH DE number 4055636 (Why is no real title available?)
• scientific article; zbMATH DE number 3674114 (Why is no real title available?)
• scientific article; zbMATH DE number 1507962 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3400923 (Why is no real title available?)
• k-Bounded classes of dominant-independent perfect graphs
• On domination and independent domination numbers of a graph
• On graphs with equal domination and independent domination numbers
• Perfect graphs of strong domination and independent strong domination
• Perfectly relating the domination, total domination, and paired domination numbers of a graph
• Strong equality of domination parameters in trees
• Unique irredundance, domination and independent domination in graphs
• Upper domination and upper irredundance perfect graphs

Cited in

(14)

• Price of connectivity for the vertex cover problem and the dominating set problem: conjectures and investigation of critical graphs
• Perfect graphs of strong domination and independent strong domination
• Models and algorithms for the product pricing with single-minded customers requesting bundles
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width
• Perfect graphs for domination games
• A characterization of domination perfect graphs
• A note on the characterization of domination perfect graphs
• An induced subgraph characterization of domination perfect graphs
• scientific article; zbMATH DE number 7378380 (Why is no real title available?)
• Computing dense and sparse subgraphs of weakly closed graphs
• On the price of independence for vertex cover, feedback vertex set and odd cycle transversal
• Common domination perfect graphs
• Independent transversals versus transversals
• On Camby-Plein's characterization of domination perfect graphs

Describes a project that uses

Uses Software

• GraphsInGraphs

This page was built for publication: A note on an induced subgraph characterization of domination perfect graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q516908)