The following pages link to (Q4500916):
Displaying 50 items.
- Algorithms for finding disjoint path covers in unit interval graphs (Q266951) (← links)
- The \((1, 2)\)-step competition graph of a pure local tournament that is not round decomposable (Q266961) (← links)
- Richardson's theorem in \(H\)-coloured digraphs (Q292262) (← links)
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs (Q321986) (← links)
- Maximum size of digraphs with some parameters (Q326498) (← links)
- Niche hypergraphs (Q339464) (← links)
- A characterization of locally semicomplete CKI-digraphs (Q343738) (← links)
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS (Q354423) (← links)
- \(H\)-kernels in infinite digraphs (Q354449) (← links)
- Characterization of signed line digraphs (Q385134) (← links)
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3 (Q392641) (← links)
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor (Q393181) (← links)
- The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments (Q393468) (← links)
- Two results on the digraph chromatic number (Q418896) (← links)
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks (Q424186) (← links)
- Immersing complete digraphs (Q427820) (← links)
- A classification of all arc-locally semicomplete digraphs (Q427828) (← links)
- A post-improvement procedure for the mixed load school bus routing problem (Q439357) (← links)
- Social choice without the Pareto principle under weak independence (Q485435) (← links)
- Towards a theory of game-based non-equilibrium control systems (Q488883) (← links)
- On panchromatic digraphs and the panchromatic number (Q489347) (← links)
- Colorings and spectral radius of digraphs (Q501071) (← links)
- Structural and spectral properties of minimal strong digraphs (Q510549) (← links)
- Componentwise complementary cycles in multipartite tournaments (Q511099) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth (Q528972) (← links)
- Kernels by monochromatic paths in digraphs with covering number 2 (Q539857) (← links)
- The multi-facility median problem with Pos/Neg weights on general graphs (Q609818) (← links)
- Commutativity conditions for groups arising from acyclic directed graphs and posets (Q616389) (← links)
- The (1,2)-step competition graph of a tournament (Q617643) (← links)
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem (Q617894) (← links)
- Maximum distance between Slater orders and Copeland orders of tournaments (Q633222) (← links)
- Digraph decompositions and monotonicity in digraph searching (Q638540) (← links)
- On the sizes of graphs and their powers: the undirected case (Q643002) (← links)
- Algorithms and complexity results for persuasive argumentation (Q646518) (← links)
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz (Q666527) (← links)
- Heuristics for the central tree problem (Q707727) (← links)
- Double-super-connected digraphs (Q708328) (← links)
- On the structure of strong 3-quasi-transitive digraphs (Q708416) (← links)
- Openly disjoint circuits through a vertex in regular digraphs (Q709312) (← links)
- On \(d\)-arc-dominated oriented graphs (Q742615) (← links)
- The number of out-pancyclic vertices in a strong tournament (Q742631) (← links)
- On the existence of noncritical vertices in digraphs (Q744557) (← links)
- Solving the minimum flow problem with interval bounds and flows (Q746432) (← links)
- Used car salesman problem: a differential auction-barter market (Q812388) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Parameterized complexity of \(d\)-hitting set with quotas (Q831823) (← links)
- Finding next-to-shortest paths in a graph (Q834912) (← links)
- Competition hypergraphs of products of digraphs (Q844216) (← links)
- Minimum cost homomorphism dichotomy for oriented cycles (Q844220) (← links)
