Domination number of graphs with minimum degree five (Q2656332): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q279226
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.7151/dmgt.2339 / rank
Normal rank
 
Property / author
 
Property / author: Csilla Bujtás / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3110267038 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1912.13499 / 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: Improved upper bounds on the domination number of graphs with minimum degree at least five / 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: Q4489228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination and total domination in cubic graphs of large girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound on the domination number of graphs with minimum degree two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On domination in connected cubic graphs / 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: Domination in graphs of minimum degree at least two and large girth / 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: 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: Domination in graphs of minimum degree five / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7151/DMGT.2339 / rank
 
Normal rank

Latest revision as of 13:30, 19 December 2024

scientific article
Language Label Description Also known as
English
Domination number of graphs with minimum degree five
scientific article

    Statements

    Domination number of graphs with minimum degree five (English)
    0 references
    11 March 2021
    0 references
    dominating set
    0 references
    domination number
    0 references
    discharging method
    0 references
    0 references

    Identifiers