The following pages link to (Q4539516):
Displaying 50 items.
- Kernels by monochromatic paths and color-perfect digraphs (Q274681) (← links)
- Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two (Q389212) (← links)
- Approximation algorithms for orienting mixed graphs (Q390889) (← links)
- On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs (Q393927) (← links)
- Consensus of second-order multi-agent systems with disturbances generated by nonlinear exosystems under switching topologies (Q398395) (← links)
- Complementary cycles in regular bipartite tournaments (Q400394) (← links)
- Entropy and the complexity of graphs revisited (Q406027) (← links)
- Vertex-disjoint cycles in regular tournaments (Q427838) (← links)
- \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs (Q442356) (← links)
- Sufficient conditions for the existence of spanning colored trees in edge-colored graphs (Q442397) (← links)
- Some remarks on the structure of strong \(k\)-transitive digraphs (Q472123) (← links)
- Three-dimensional circular formations via set stabilization (Q490861) (← links)
- Some results on 4-transitive digraphs (Q503671) (← links)
- Rainbow connectivity of cacti and of some infinite digraphs (Q521748) (← links)
- The minimum feedback arc set problem and the acyclic disconnection for graphs (Q526233) (← links)
- Cycles in \(k\)-traceable oriented graphs (Q641171) (← links)
- Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree (Q708429) (← links)
- A new bound for a particular case of the Caccetta-Häggkvist conjecture (Q712265) (← links)
- Exact localisations of feedback sets (Q722200) (← links)
- Equilibria for games with combined qualitative and quantitative objectives (Q824280) (← links)
- Efficient numerical methods for gas network modeling and simulation (Q828481) (← links)
- Lexicographic product of digraphs and related boundary-type sets (Q831723) (← links)
- Cycles and communicating classes in membrane systems and molecular dynamics (Q872209) (← links)
- DNA sequence assembly involving an acyclic graph model (Q902714) (← links)
- Synthesizing bounded-time 2-phase fault recovery (Q903518) (← links)
- An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs (Q959515) (← links)
- Links in edge-colored graphs (Q966157) (← links)
- An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs (Q975758) (← links)
- Returnability in complex directed networks (digraphs) (Q1014455) (← links)
- A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps (Q1015012) (← links)
- On detour homogeneous digraphs (Q1045177) (← links)
- On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\) (Q1617015) (← links)
- Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity (Q1630926) (← links)
- Adaptive coordinated attitude control for spacecraft formation with saturating actuators and unknown inertia (Q1717476) (← links)
- Boundary vertices of Cartesian product of directed graphs (Q1738686) (← links)
- \(k\)-distinct in- and out-branchings in digraphs (Q1747490) (← links)
- Incentives and the structure of communication (Q1753690) (← links)
- From kernels in directed graphs to fixed points and negative cycles in Boolean networks (Q1949117) (← links)
- On blow-ups and injectivity of quivers (Q1953529) (← links)
- Critical kernel imperfect problem in generalizations of bipartite tournaments (Q2000560) (← links)
- A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs (Q2032354) (← links)
- Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code (Q2042600) (← links)
- Projective dimension and regularity of powers of edge ideals of vertex-weighted rooted forests (Q2045255) (← links)
- A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs (Q2062898) (← links)
- Game-perfect semiorientations of forests (Q2118241) (← links)
- Disjoint cycles of different lengths in 3-regular digraphs (Q2121484) (← links)
- NMR assignment through linear programming (Q2131136) (← links)
- Implicit power indices for measuring indirect control in corporate structures (Q2151324) (← links)
- On the fixed-parameter tractability of the maximum connectivity improvement problem (Q2195571) (← links)
- \(k\)-ary spanning trees contained in tournaments (Q2197413) (← links)
