The following pages link to Yannis Manoussakis (Q442365):
Displaying 30 items.
- (Q198728) (redirect page) (← links)
- Proper connection of graphs (Q442366) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Network majority on tree topological network (Q510545) (← links)
- \(k\)-linked and \(k\)-cyclic digraphs (Q917574) (← links)
- Cycles and paths of many lengths in bipartite digraphs (Q923098) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- Longest cycles in 3-connected graphs with given independence number (Q1043819) (← links)
- A linear-time algorithm for finding Hamiltonian cycles in tournaments (Q1192953) (← links)
- The forwarding index of communication networks with given connectivity (Q1199420) (← links)
- Hamiltonian paths and cycles, number of arcs and independence number in digraphs (Q1199482) (← links)
- A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems (Q1285548) (← links)
- Cycles through \(k\) vertices in bipartite tournaments (Q1330800) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Complementary cycles containing a fixed arc in diregular bipartite tournaments (Q1336719) (← links)
- Maximum colorful cycles in vertex-colored graphs (Q1625149) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Further results on degree sets for graphs (Q1773838) (← links)
- Maximum colorful cliques in vertex-colored graphs (Q1791008) (← links)
- Maximum colorful independent sets in vertex-colored graphs (Q1792109) (← links)
- A sufficient condition for maximum cycles in bipartite digraphs (Q1817571) (← links)
- Cycles and paths in bipartite tournaments with spanning configurations (Q1823256) (← links)
- Alternating paths in edge-colored complete graphs (Q1842658) (← links)
- The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle (Q1869211) (← links)
- Weakly hamiltonian-connected vertices in bipartite tournaments (Q1892846) (← links)
- Minimum \((2,r)\)-metrics and integer multiflows (Q1911842) (← links)
- The forwarding index of directed networks (Q1923618) (← links)
- Safe sets, network majority on weighted trees (Q5228508) (← links)
- Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results (Q5689636) (← links)
