scientific article; zbMATH DE number 1498519
From MaRDI portal
Publication:4500916
Recommendations
Cited in
(only showing first 100 items - show all)- Digraphs. Theory, algorithms and applications
- An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology
- Commutativity conditions for groups arising from acyclic directed graphs and posets
- On \(d\)-arc-dominated oriented graphs
- On the existence of noncritical vertices in digraphs
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Maximum size of digraphs with some parameters
- Prefix graphs and their applications
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
- Embedding on alphabet overlap digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Rainbow triangles in arc-colored tournaments
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Super-connected and super-arc-connected Cartesian product of digraphs
- Solving the minimum flow problem with interval bounds and flows
- Longest path partitions in generalizations of tournaments
- On panchromatic digraphs and the panchromatic number
- Towards a theory of game-based non-equilibrium control systems
- Characterizations for some types of DNA graphs
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- Weakening arcs in tournaments
- The time-dependent rural postman problem: polyhedral results
- Niche hypergraphs
- Properly coloured cycles and paths: Results and open problems
- A framework for multi-robot node coverage in sensor networks
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Double-super-connected digraphs
- On \(n\)-partite tournaments with unique \(n\)-cycle
- Social choice without the Pareto principle under weak independence
- H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs.
- Parameterized algorithms for feedback set problems and their duals in tournaments
- A lower bound on the Hamiltonian path completion number of a line graph
- Finding next-to-shortest paths in a graph
- Niche hypergraphs of products of digraphs
- Minimal feedback vertex sets in directed split‐stars
- A characterization of locally semicomplete CKI-digraphs
- The complexity of Boolean matrix root computation
- Minimum cycle factors in quasi-transitive digraphs
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- scientific article; zbMATH DE number 3841916 (Why is no real title available?)
- On persistent directed graphs
- Transitive convex subsets in large tournaments
- Maximum distance between Slater orders and Copeland orders of tournaments
- Digraph decompositions and monotonicity in digraph searching
- Decomposing and colouring some locally semicomplete digraphs
- Every cycle-connected multipartite tournament with 2 contains at least two universal ARCS
- High connectivity keeping sets in graphs and digraphs
- Functional integration of ecological networks through pathway proliferation
- Competition hypergraphs of products of digraphs
- Computing sparse and dense realizations of reaction kinetic systems
- The multi-facility median problem with Pos/Neg weights on general graphs
- On a cyclic connectivity property of directed graphs
- On edge-colored graphs covered by properly colored cycles
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Infinite quasi-transitive digraphs with domination number 2
- Some inequalities for orderings of acyclic digraphs
- An efficient distributed algorithm for canonical labeling on directed split-stars
- Spectral radius of strongly connected digraphs
- CKI-digraphs, generalized sums and partitions of digraphs
- scientific article; zbMATH DE number 46091 (Why is no real title available?)
- Disjoint quasi-kernels in digraphs
- A classification of arc-locally semicomplete digraphs
- Colorings and spectral radius of digraphs
- A Polyhedral Description of Kernels
- How to recycle your facets
- DNA labelled graphs with DNA computing
- Existence of openly disjoint circuits through a vertex
- Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments
- Vertex-disjoint quadrilaterals in multigraphs
- Degree complete graphs
- Classification of real Bott manifolds and acyclic digraphs
- Algorithms and complexity results for persuasive argumentation
- Minimum flow variation in maximum flows
- A computational perspective on network coding
- On arc-traceable tournaments
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- Structural and spectral properties of minimal strong digraphs
- Componentwise complementary cycles in multipartite tournaments
- Algorithms for junctions in acyclic digraphs
- Full-rank affine invariant submanifolds
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Miscellaneous digraph classes
- On the number of noncritical vertices in strongly connected digraphs
- Competition hypergraphs
- Minimum average distance of strong orientations of graphs
- The Hamiltonicity on the competition graphs of round digraphs
- A multi-city epidemic model
- Global stability for the three-dimensional logistic map
- Characterization of signed line digraphs
- \(\Pi\)-kernels in digraphs
- Digraph Decompositions and Eulerian Systems
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Finding complementary cycles in locally semicomplete digraphs
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
- Rainbow triangles in arc-colored digraphs
- A construction of uniquely \(n\)-colorable digraphs with arbitrarily large digirth
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- The acyclic and C₃-free disconnection of tournaments
- Normal Helly circular-arc graphs and its subclasses
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4500916)
