Dominating sets with small clique covering number

DOI<101::AID-JGT1>3.0.CO;2-Q 10.1002/(SICI)1097-0118(199706)25:2<101::AID-JGT1>3.0.CO;2-QzbMath0876.05046OpenAlexW4247564791MaRDI QIDQ4344210

S. G. Penrice

Publication date: 25 November 1997

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199706)25:2<101::aid-jgt1>3.0.co;2-q

zbMATH Keywords

dominating setclique covering number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Characterization of graphs dominated by induced paths ⋮ Infinite versus finite graph domination ⋮ Complete description of forbidden subgraphs in the structural domination problem ⋮ Domination, coloring and stability in \(P_5\)-reducible graphs