Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (Q2357136): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.04.016 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2620326804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Nordhaus-Gaddum inequalities for domination. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus–Gaddum‐type Theorems for decompositions into many parts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some nordhaus‐‐ gaddum‐type results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum inequalities for domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum bounds for total domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5403009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632603 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds on chromatic numbers of multiple factors of a complete graph / rank
 
Normal rank

Latest revision as of 23:38, 13 July 2024

scientific article
Language Label Description Also known as
English
Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars
scientific article

    Statements

    Improving a Nordhaus-Gaddum type bound for total domination using an algorithm involving vertex disjoint stars (English)
    0 references
    0 references
    19 June 2017
    0 references
    Nordhaus-Gaddum-type results
    0 references
    total domination
    0 references
    relative complement
    0 references

    Identifiers