Upper minus domination in a claw-free cubic graph (Q860466): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The algorithmic complexity of minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Signed domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4374702 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination number in cubic graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper minus domination in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minus domination number in \(k\)-partite graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the minus domination and \(k\)-subdomination numbers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552219 / rank
 
Normal rank

Latest revision as of 12:06, 25 June 2024

scientific article
Language Label Description Also known as
English
Upper minus domination in a claw-free cubic graph
scientific article

    Statements