The following pages link to (Q4500916):
Displaying 50 items.
- Computing sparse and dense realizations of reaction kinetic systems (Q848181) (← links)
- An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology (Q883806) (← links)
- \(\Pi\)-kernels in digraphs (Q897229) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- Products of digraphs and their competition graphs (Q907830) (← links)
- Minimum cycle factors in quasi-transitive digraphs (Q924641) (← links)
- DNA labelled graphs with DNA computing (Q931505) (← links)
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach (Q941336) (← links)
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion (Q954963) (← links)
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree (Q960967) (← links)
- Eigenvalues and colorings of digraphs (Q962116) (← links)
- A memetic algorithm for the generalized traveling salesman problem (Q968380) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\) (Q973119) (← links)
- Super-connected and super-arc-connected Cartesian product of digraphs (Q975411) (← links)
- The bondage number in complete \(t\)-partite digraphs (Q989552) (← links)
- The restricted arc connectivity of Cartesian product digraphs (Q990960) (← links)
- Making choices with a binary relation: relative choice axioms and transitive closures (Q992691) (← links)
- An efficient distributed algorithm for canonical labeling on directed split-stars (Q1003736) (← links)
- Sufficient conditions for super-arc-strongly connected oriented graphs (Q1015435) (← links)
- Convex sets in acyclic digraphs (Q1016095) (← links)
- A framework for multi-robot node coverage in sensor networks (Q1022471) (← links)
- Triangle packings and 1-factors in oriented graphs (Q1026012) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic (Q1043814) (← links)
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs (Q1045053) (← links)
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs (Q1405121) (← links)
- Gibbsian stationary non-equilibrium states (Q1676556) (← links)
- Structural properties of minimal strong digraphs versus trees (Q1688914) (← links)
- Full-rank affine invariant submanifolds (Q1700515) (← links)
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic (Q1701114) (← links)
- Tree-based networks: characterisations, metrics, and support trees (Q1731941) (← links)
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs (Q1732099) (← links)
- Cost and accuracy aware scientific workflow retrieval based on distance measure (Q1749198) (← links)
- Spectral radius of strongly connected digraphs (Q1759409) (← links)
- Finding complementary cycles in locally semicomplete digraphs (Q1763478) (← links)
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs (Q1785251) (← links)
- Idempotent and co-idempotent stack filters and min--max operators. (Q1874413) (← links)
- The complexity of Boolean matrix root computation (Q1884841) (← links)
- Minimum average distance of strong orientations of graphs (Q1887055) (← links)
- Competition hypergraphs (Q1887068) (← links)
- Robustness of minimum cost arborescences (Q1926648) (← links)
- Normal Helly circular-arc graphs and its subclasses (Q1949109) (← links)
- A computational perspective on network coding (Q1958831) (← links)
- The generalized distance matrix of digraphs (Q2002706) (← links)
- Extension of Gyárfás-Sumner conjecture to digraphs (Q2030749) (← links)
- Rainbow triangles in arc-colored tournaments (Q2042207) (← links)
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs (Q2097174) (← links)
- Paths in \([ h , k ]\)-bipartite hypertournaments (Q2113720) (← links)
- Vertex-disjoint cycles of different lengths in multipartite tournaments (Q2124611) (← links)
