The following pages link to Digraphs (Q5502988):
Displaying 50 items.
- Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs (Q267208) (← links)
- Completions of Leavitt path algebras. (Q270065) (← links)
- Explicit formulae for limit periodic flows on networks (Q272335) (← links)
- On Browder's convergence theorem and Halpern iteration process for \(G\)-nonexpansive mappings in Hilbert spaces endowed with graphs (Q288185) (← links)
- Finding good 2-partitions of digraphs. I. Hereditary properties (Q290530) (← links)
- On the lower bound of \(k\)-maximal digraphs (Q294549) (← links)
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Rural postman parameterized by the number of components of required edges (Q314816) (← links)
- On pancyclic arcs in hypertournaments (Q323068) (← links)
- Dichromatic polynomial of product digraphs (Q327643) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- Intuitionistic fuzzy competition graphs (Q330356) (← links)
- Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
- Parameterized complexity of the \(k\)-arc Chinese postman problem (Q340562) (← links)
- Antistrong digraphs (Q345072) (← links)
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Parameterized complexity of \(k\)-Chinese postman problem (Q391983) (← links)
- Vertex-disjoint directed and undirected cycles in general digraphs (Q402588) (← links)
- The complexity of two graph orientation problems (Q412352) (← links)
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs (Q414643) (← links)
- On making directed graphs transitive (Q414917) (← links)
- On spanning galaxies in digraphs (Q415275) (← links)
- On the acyclic disconnection of multipartite tournaments (Q427897) (← links)
- Notes on the deficiency-one theorem: multiple linkage classes (Q433682) (← links)
- Arc-disjoint spanning sub(di)graphs in digraphs (Q441857) (← links)
- \(k\)-colored kernels (Q442210) (← links)
- An algorithm for finding input-output constrained convex sets in an acyclic digraph (Q450526) (← links)
- Pancyclic out-arcs of a vertex in oriented graphs (Q456111) (← links)
- Stochastic stability in one-way flow networks (Q459418) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- Controllability of weighted and directed networks with nonidentical node dynamics (Q473594) (← links)
- Asymptotic behaviour of flows on reducible networks (Q480064) (← links)
- Group pinning consensus under fixed and randomly switching topologies with acyclic partition (Q480089) (← links)
- A spectral excess theorem for normal digraphs (Q494302) (← links)
- Cycles through an arc in regular 3-partite tournaments (Q501021) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- The dichromatic number of infinite families of circulant tournaments (Q503681) (← links)
- Odd properly colored cycles in edge-colored graphs (Q507513) (← links)
- The entropy method for reaction-diffusion systems without detailed balance: first order chemical reaction networks (Q516267) (← links)
- Chinese postman problem on edge-colored multigraphs (Q516812) (← links)
- Strongly connected multivariate digraphs (Q521369) (← links)
- A note on the relationship between graphs and information protocols (Q542143) (← links)
- Independent sets and non-augmentable paths in arc-locally in-semicomplete digraphs and quasi-arc-transitive digraphs (Q626767) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Properly colored paths and cycles (Q642961) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- FPT algorithms for connected feedback vertex set (Q695322) (← links)
- A random intersection digraph: indegree and outdegree distributions (Q708428) (← links)
- What is on his mind? (Q709300) (← links)
