Improved upper bounds on the domination number of graphs with minimum degree at least five (Q292247): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1899855728 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59072382 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1410.4334 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transversal numbers of uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2910020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sequences in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination Game and an Imagination Strategy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs of minimum degree at least two and large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4489228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight upper bounds for the domination numbers of graphs with given order and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5302113 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Problems for Game Domination Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: An upper bound on the domination number of \(n\)-vertex connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination number of cubic graphs with large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairs of disjoint dominating sets in connected cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4108373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Stars and the Number Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: DOMINATION IN GRAPHS OF MINIMUM DEGREE FOUR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5310205 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in graphs of minimum degree five / rank
 
Normal rank

Latest revision as of 03:12, 12 July 2024

scientific article
Language Label Description Also known as
English
Improved upper bounds on the domination number of graphs with minimum degree at least five
scientific article

    Statements

    Improved upper bounds on the domination number of graphs with minimum degree at least five (English)
    0 references
    0 references
    0 references
    13 June 2016
    0 references
    domination number
    0 references
    minimum degree
    0 references
    greedy algorithm
    0 references

    Identifiers

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