Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs (Q510554): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Distance domination, guarding and covering of maximal outerplanar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dominating sets of 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2878209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets whose closed stars form spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets of maximal outerplanar graphs / rank
 
Normal rank

Latest revision as of 09:53, 13 July 2024

scientific article
Language Label Description Also known as
English
Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
scientific article

    Statements

    Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 February 2017
    0 references
    domination
    0 references
    maximal outerplanar graph
    0 references
    connectivity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references