Graphs without induced P5and C5

DOI10.7151/DMGT.1248zbMath1064.05108OpenAlexW2399301123MaRDI QIDQ4668435

Gábor Bacsó, Zsolt Tuza

Publication date: 19 April 2005

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1248

zbMATH Keywords

characterizationgraph dominationconnected dominationforbidden induced subgraphcomplete subgraph

Mathematics Subject Classification ID

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

Related Items (3)

Connected domination number and a new invariant in graphs with independence number three ⋮ Connected Domination ⋮ Complete description of forbidden subgraphs in the structural domination problem

This page was built for publication: Graphs without induced P₅and C₅