Nordhaus-Gaddum bounds for total domination (Q2430063): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.aml.2011.01.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2048585464 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total 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: A survey of selected recent results on total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complementary Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613121 / 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: Q4374725 / 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 bounds for independent domination / 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: Domination-balanced graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected domination number of a graph and its complement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on domination / rank
 
Normal rank
Property / cites work
 
Property / cites work: Small transversals in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering all cliques of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination of graphs and small transversals of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraphs with large transversal number and with edge sizes at least 3 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 23:18, 3 July 2024

scientific article
Language Label Description Also known as
English
Nordhaus-Gaddum bounds for total domination
scientific article

    Statements

    Nordhaus-Gaddum bounds for total domination (English)
    0 references
    0 references
    0 references
    0 references
    5 April 2011
    0 references
    0 references
    Nordhaus-Gaddum
    0 references
    total domination
    0 references
    0 references