On graphs for which the connected domination number is at most the total domination number (Q423952): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complete description of forbidden subgraphs in the structural domination problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets for split and bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graphs with equal total domination and connected domination numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4826135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paired-domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hereditary Domination in Graphs: Characterization with Forbidden Induced Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect connected-dominant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A semi-induced subgraph characterization of upper domination perfect graphs / rank
 
Normal rank

Latest revision as of 07:29, 5 July 2024

scientific article
Language Label Description Also known as
English
On graphs for which the connected domination number is at most the total domination number
scientific article

    Statements

    Identifiers