The following pages link to (Q4500916):
Displaying 50 items.
- Rainbow triangles in arc-colored digraphs (Q2127620) (← links)
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem (Q2197095) (← links)
- Functional integration of ecological networks through pathway proliferation (Q2209913) (← links)
- Choice resolutions (Q2235096) (← links)
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs (Q2250761) (← links)
- Embedding on alphabet overlap digraphs (Q2267826) (← links)
- On 3-regular digraphs of girth 4 (Q2279278) (← links)
- Niche hypergraphs of products of digraphs (Q2282480) (← links)
- Stochastic monotonicity from an Eulerian viewpoint (Q2318631) (← links)
- Solving the selective multi-category parallel-servicing problem (Q2341388) (← links)
- An integer programming approach for the Chinese postman problem with time-dependent travel time (Q2343981) (← links)
- On the vertices of a 3-partite tournament not in triangles (Q2352064) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- An extension of Richardson's theorem in m-colored digraphs (Q2354614) (← links)
- Infinite quasi-transitive digraphs with domination number 2 (Q2357773) (← links)
- The energy of the alphabet model (Q2364605) (← links)
- Degree complete graphs (Q2368928) (← links)
- Characterizations for some types of DNA graphs (Q2385373) (← links)
- Proper Hamiltonian cycles in edge-colored multigraphs (Q2397532) (← links)
- On 3-regular digraphs without vertex disjoint cycles of different lengths (Q2397536) (← links)
- The representation of partially-concurrent open shop problems (Q2398435) (← links)
- Proper Hamiltonian paths in edge-colored multigraphs (Q2409503) (← links)
- Vertex-disjoint quadrilaterals in multigraphs (Q2409526) (← links)
- The Hamiltonicity on the competition graphs of round digraphs (Q2422588) (← links)
- Independent sets and non-augmentable paths in generalizations of tournaments (Q2427505) (← links)
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs (Q2427693) (← links)
- A note on the spectral characterization of strongly connected bicyclic digraphs (Q2427939) (← links)
- Spectral radius of digraphs with given dichromatic number (Q2431161) (← links)
- Choices and kernels in bipolar valued digraphs (Q2432842) (← links)
- The distance spectral radius of digraphs (Q2444546) (← links)
- On a cyclic connectivity property of directed graphs (Q2469976) (← links)
- On the number of noncritical vertices in strongly connected digraphs (Q2473681) (← links)
- Computational complexity of isothermic DNA sequencing by hybridization (Q2489897) (← links)
- On the structure of the adjacency matrix of the line digraph of a regular digraph (Q2499597) (← links)
- Longest path partitions in generalizations of tournaments (Q2501556) (← links)
- On \(n\)-partite tournaments with unique \(n\)-cycle (Q2502031) (← links)
- How to recycle your facets (Q2506820) (← links)
- On vertex disjoint cycles of different lengths in 3-regular digraphs (Q2515591) (← links)
- Disjoint \(A\)-paths in digraphs (Q2565693) (← links)
- On edge-colored graphs covered by properly colored cycles (Q2573800) (← links)
- High connectivity keeping sets in graphs and digraphs (Q2575793) (← links)
- Strong subtournaments and cycles of multipartite tournaments (Q2629292) (← links)
- Minimal autocatalytic networks (Q2635148) (← links)
- Resolutions of convex geometries (Q2665967) (← links)
- Decomposing and colouring some locally semicomplete digraphs (Q2674564) (← links)
- The Parity Hamiltonian Cycle Problem in Directed Graphs (Q2835661) (← links)
- A classification of arc-locally semicomplete digraphs (Q2851438) (← links)
- The time-dependent rural postman problem: polyhedral results (Q2867412) (← links)
- Causality, conditional independence, and graphical separation in settable systems (Q2919416) (← links)
- Classification of real Bott manifolds and acyclic digraphs (Q2951926) (← links)
