Computational complexity of compaction to irreflexive cycles (Q596309): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Absolute retracts of bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute reflexive retracts and absolute bipartite retracts / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms to reflexive graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: List homomorphisms and circular arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4049082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of H-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Absolute Retracts and Varieties of Reflexive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-edge theorem for graphs with loops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994353 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of absolute retracts of n-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity of Compaction to Reflexive Cycles / rank
 
Normal rank

Latest revision as of 19:42, 6 June 2024

scientific article
Language Label Description Also known as
English
Computational complexity of compaction to irreflexive cycles
scientific article

    Statements