Combinatorial bounds on paired and multiple domination in triangulations (Q1792065): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in maximal outerplanar graphs. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691778 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552196 / 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: Dominating sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Galleries need fewer mobile guards: A variation on Chvatal's theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets of maximal outerplanar graphs / rank
 
Normal rank

Revision as of 20:01, 16 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial bounds on paired and multiple domination in triangulations
scientific article

    Statements

    Combinatorial bounds on paired and multiple domination in triangulations (English)
    0 references
    0 references
    0 references
    0 references
    11 October 2018
    0 references
    domination
    0 references
    maximal outerplanar graph
    0 references
    triangulation
    0 references

    Identifiers