Dominating sets with small clique covering number

DOI10.1002/(SICI)1097-0118(199706)25:2%3C101::AID-JGT1%3E3.0.CO;2-QzbMATH Open0876.05046OpenAlexW4247564791MaRDI QIDQ4344210FDOQ4344210

Authors: S. G. Penrice 

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199706)25:2%3C101::aid-jgt1%3E3.0.co;2-q

Recommendations

• scientific article; zbMATH DE number 1247724
• Dominating cliques in graphs
• Dominating cliques in graphs
• Dominating subgraphs in graphs with some forbidden structures

zbMATH Keywords

dominating setclique covering number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cited In (7)

• Infinite versus finite graph domination
• Domination, coloring and stability in \(P_5\)-reducible graphs
• New results on connected dominating structures in graphs
• Domination using induced cliques in graphs
• Complete description of forbidden subgraphs in the structural domination problem
• Characterization of graphs dominated by induced paths
• Dominating subgraphs in graphs with some forbidden structures

This page was built for publication: Dominating sets with small clique covering number

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