The following pages link to Digraphs (Q5502988):
Displaying 50 items.
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- On the most imbalanced orientation of a graph (Q721946) (← links)
- Binary linear programming solutions and non-approximability for control problems in voting systems (Q741772) (← links)
- Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs (Q742591) (← links)
- Vertex alternating-pancyclism in 2-edge-colored generalized sums of graphs (Q777393) (← links)
- Weak expansion properties and large deviation principles for expanding Thurston maps (Q887313) (← links)
- Connectivity of some algebraically defined digraphs (Q888582) (← links)
- A linear bound towards the traceability conjecture (Q895060) (← links)
- Hypohamiltonian oriented graphs of all possible orders (Q897240) (← links)
- Triangle-free oriented graphs and the traceability conjecture (Q898141) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Directed NLC-width (Q906393) (← links)
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs (Q967291) (← links)
- Spanning 2-strong tournaments in 3-strong semicomplete digraphs (Q968409) (← links)
- Local tournaments with the minimum number of Hamiltonian cycles or cycles of length three (Q973120) (← links)
- Disjoint directed and undirected paths and cycles in digraphs (Q1034635) (← links)
- Minimum leaf out-branching and related problems (Q1035689) (← links)
- Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
- Highly connected hypergraphs containing no two edge-disjoint spanning connected subhypergraphs (Q1410701) (← links)
- Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. (Q1427175) (← links)
- Statistical mechanics of ontology based annotations (Q1618908) (← links)
- Multiaspect graphs: algebraic representation and algorithms (Q1662581) (← links)
- Generalized network transport and Euler-Hille formula (Q1671122) (← links)
- Vertex disjoint 4-cycles in bipartite tournaments (Q1699558) (← links)
- Locally dense supereulerian digraphs (Q1701108) (← links)
- Out-degree reducing partitions of digraphs (Q1704574) (← links)
- Cartesian product digraphs with optimal restricted arc connectivity (Q1707986) (← links)
- Arc-disjoint Hamiltonian cycles in round decomposable locally semicomplete digraphs (Q1708395) (← links)
- The second neighbourhood for bipartite tournaments (Q1717210) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- Effects of adding a reverse edge across a stem in a directed acyclic graph (Q1737833) (← links)
- Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
- Degree constrained 2-partitions of semicomplete digraphs (Q1784748) (← links)
- Minimal positive realizations of linear continuous-time fractional descriptor systems: two cases of an input-output digraph structure (Q1787059) (← links)
- The second neighbourhood for quasi-transitive oriented graphs (Q1788704) (← links)
- Maximum matchings of a digraph based on the largest geometric multiplicity (Q1793197) (← links)
- The structure of strong arc-locally semicomplete digraphs (Q1827761) (← links)
- Game-perfect digraphs (Q1935960) (← links)
- The representation polyhedron of a semiorder. (Q1943679) (← links)
- Quasi-hamiltonian paths in semicomplete multipartite digraphs (Q1949094) (← links)
- Properly colored cycles in edge-colored complete graphs without monochromatic triangle: a vertex-pancyclic analogous result (Q1981705) (← links)
- Symmetric core and spanning trails in directed networks (Q1981711) (← links)
- Pairings and related symmetry notions (Q1989479) (← links)
- Berge's conjecture and Aharoni-Hartman-Hoffman's conjecture for locally in-semicomplete digraphs (Q2000583) (← links)
- Oriented coloring on recursively defined digraphs (Q2003341) (← links)
- Expansive automata networks (Q2003992) (← links)
- Vertex-disjoint cycles in local tournaments (Q2005720) (← links)
- Spanning Eulerian subdigraphs avoiding \(k\) prescribed arcs in tournaments (Q2005723) (← links)
- Quality analysis in acyclic production networks (Q2009806) (← links)
