Changes
Created page with '<onlyinclude> Can we determine the [[Source-stable set|Fries number]] of an acyclic digraph in polynomial time? Is it true that the Fries number equals the maximum size of the u…'
<onlyinclude>
Can we determine the [[Source-stable set|Fries number]] of an acyclic digraph in polynomial time? Is it true that the Fries number equals the maximum size of the union of two [[Source-stable set|source-stable sets]]?
</onlyinclude>
==Remarks==
==References==
<references/>
[[Category:Colouring]]
[[Category:Open Problems]]
Can we determine the [[Source-stable set|Fries number]] of an acyclic digraph in polynomial time? Is it true that the Fries number equals the maximum size of the union of two [[Source-stable set|source-stable sets]]?
</onlyinclude>
==Remarks==
==References==
<references/>
[[Category:Colouring]]
[[Category:Open Problems]]
