Partitioning a graph into alliance free sets (Q1025928): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.08.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2132985585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unfriendly partitions of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The satisfactory partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a theorem about vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On an upper bound of the graph's chromatic number, depending on the graph's degree and density / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powerful alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing graphs with girth at least five under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Offensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition of graphs with condition on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global defensive alliances in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4820818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of triangle-free graphs under degree constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4405794 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5488895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472692 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3211331 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715286 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank
 
Normal rank

Latest revision as of 17:28, 1 July 2024

scientific article
Language Label Description Also known as
English
Partitioning a graph into alliance free sets
scientific article

    Statements

    Partitioning a graph into alliance free sets (English)
    0 references
    0 references
    0 references
    23 June 2009
    0 references
    0 references
    alliance
    0 references
    defensive alliance
    0 references
    alliance-free set
    0 references
    alliance cover set
    0 references
    vertex partition
    0 references
    0 references