The following pages link to (Q4273847):
Displaying 18 items.
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- Finding a subdivision of a digraph (Q476873) (← links)
- Fastest expected time to mixing for a Markov chain on a directed graph (Q603129) (← links)
- On polynomial cases of the unichain classification problem for Markov decision processes (Q957336) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- The Gallai-Younger conjecture for planar graphs (Q1375627) (← links)
- Packing directed circuits (Q1375699) (← links)
- Positive and negative cycles in Boolean networks (Q1717061) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- Nearly sign-nonsingular matrices (Q1893090) (← links)
- A note on the satisfactory partition problem: constant size requirement (Q2094373) (← links)
- Restricted cycle factors and arc-decompositions of digraphs (Q2354716) (← links)
- On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
- NP-hardness of checking the unichain condition in average cost MDPs (Q2467470) (← links)
- Spectra and inverse sign patterns of nearly sign-nonsingular matrices (Q2564916) (← links)
- Finding good 2-partitions of digraphs. II. Enumerable properties (Q2629228) (← links)
- Extremality criteria for the supereigenvector space in max-plus algebra (Q2676737) (← links)
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)
