Partitioning a graph into offensive \(k\)-alliances (Q629362): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q57974381, #quickstatements; #temporary_batch_1706974296281
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: José María Sigarreta-Almira / rank
Normal rank
 
Property / author
 
Property / author: Ismael González Yero / rank
Normal rank
 
Property / author
 
Property / author: Juan Alberto Rodríguez-Velázquez / rank
Normal rank
 
Property / author
 
Property / author: José María Sigarreta-Almira / rank
 
Normal rank
Property / author
 
Property / author: Ismael González Yero / rank
 
Normal rank
Property / author
 
Property / author: Juan Alberto Rodríguez-Velázquez / rank
 
Normal rank
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.dam.2010.11.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2743337920 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On global offensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677972 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global alliances and independence in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3620532 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4897506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive \(r\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The alliance partition number of grid graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive \(k\)-alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complement graph and defensive \(k\)-alliances / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defensive alliances and line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the global offensive alliance number of a graph / rank
 
Normal rank

Latest revision as of 20:00, 3 July 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into offensive \(k\)-alliances
scientific article

    Statements

    Partitioning a graph into offensive \(k\)-alliances (English)
    0 references
    9 March 2011
    0 references
    offensive alliances
    0 references
    dominating sets
    0 references
    domination number
    0 references
    chromatic number
    0 references

    Identifiers