Downhill domination problem in graphs (Q2345854): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an 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.ipl.2015.02.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2083128215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On perfect packings in dense graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5267494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Downhill domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit degree condition for Hamiltonian graphs / rank
 
Normal rank

Latest revision as of 03:25, 10 July 2024

scientific article
Language Label Description Also known as
English
Downhill domination problem in graphs
scientific article

    Statements

    Downhill domination problem in graphs (English)
    0 references
    0 references
    0 references
    21 May 2015
    0 references
    0 references
    combinatorial problems
    0 references
    downhill domination number
    0 references
    direct dominating set
    0 references
    linear time algorithm
    0 references
    0 references