Semicomplete absorbent sets in digraphs (Q4956182): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5442546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in \(P_ 5\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating sets in social network graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating cliques in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5844986 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels in infinite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3895508 / rank
 
Normal rank

Latest revision as of 12:17, 26 July 2024

scientific article; zbMATH DE number 7389420
Language Label Description Also known as
English
Semicomplete absorbent sets in digraphs
scientific article; zbMATH DE number 7389420

    Statements

    Semicomplete absorbent sets in digraphs (English)
    0 references
    1 September 2021
    0 references
    semicomplete
    0 references
    absorbent
    0 references
    domination
    0 references
    Cartesian
    0 references
    composition
    0 references

    Identifiers