scientific article; zbMATH DE number 1498519
From MaRDI portal
Publication:4500916
Recommendations
Cited in
(only showing first 100 items - show all)- An efficient distributed algorithm for canonical labeling on directed split-stars
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Convex sets in acyclic digraphs
- A framework for multi-robot node coverage in sensor networks
- Triangle packings and 1-factors in oriented graphs
- Almost 2-SAT is fixed-parameter tractable
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
- Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Gibbsian stationary non-equilibrium states
- Structural properties of minimal strong digraphs versus trees
- Full-rank affine invariant submanifolds
- Sufficient conditions for a balanced bipartite digraph to be even pancyclic
- Tree-based networks: characterisations, metrics, and support trees
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Spectral radius of strongly connected digraphs
- Finding complementary cycles in locally semicomplete digraphs
- Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs
- Idempotent and co-idempotent stack filters and min--max operators.
- The complexity of Boolean matrix root computation
- Minimum average distance of strong orientations of graphs
- Competition hypergraphs
- Robustness of minimum cost arborescences
- Normal Helly circular-arc graphs and its subclasses
- A computational perspective on network coding
- The generalized distance matrix of digraphs
- Extension of Gyárfás-Sumner conjecture to digraphs
- Rainbow triangles in arc-colored tournaments
- Disproof of a conjecture on the rainbow triangles in arc-colored digraphs
- Paths in \([ h , k ]\)-bipartite hypertournaments
- Vertex-disjoint cycles of different lengths in multipartite tournaments
- Rainbow triangles in arc-colored digraphs
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem
- Functional integration of ecological networks through pathway proliferation
- Choice resolutions
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Embedding on alphabet overlap digraphs
- On 3-regular digraphs of girth 4
- Niche hypergraphs of products of digraphs
- Stochastic monotonicity from an Eulerian viewpoint
- Solving the selective multi-category parallel-servicing problem
- An integer programming approach for the Chinese postman problem with time-dependent travel time
- On the vertices of a 3-partite tournament not in triangles
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- An extension of Richardson's theorem in m-colored digraphs
- Infinite quasi-transitive digraphs with domination number 2
- The energy of the alphabet model
- Degree complete graphs
- Characterizations for some types of DNA graphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- On 3-regular digraphs without vertex disjoint cycles of different lengths
- The representation of partially-concurrent open shop problems
- Vertex-disjoint quadrilaterals in multigraphs
- The Hamiltonicity on the competition graphs of round digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Spectral radius of digraphs with given dichromatic number
- Choices and kernels in bipolar valued digraphs
- The distance spectral radius of digraphs
- On a cyclic connectivity property of directed graphs
- On the number of noncritical vertices in strongly connected digraphs
- Computational complexity of isothermic DNA sequencing by hybridization
- On the structure of the adjacency matrix of the line digraph of a regular digraph
- Longest path partitions in generalizations of tournaments
- On \(n\)-partite tournaments with unique \(n\)-cycle
- How to recycle your facets
- On vertex disjoint cycles of different lengths in 3-regular digraphs
- Disjoint A-paths in digraphs
- On edge-colored graphs covered by properly colored cycles
- High connectivity keeping sets in graphs and digraphs
- Strong subtournaments and cycles of multipartite tournaments
- Minimal autocatalytic networks
- Resolutions of convex geometries
- Algorithms for finding disjoint path covers in unit interval graphs
- The (1, 2)-step competition graph of a pure local tournament that is not round decomposable
- Decomposing and colouring some locally semicomplete digraphs
- T-irreducible extension of polygonal digraphs
- The parity Hamiltonian cycle problem in directed graphs
- A classification of arc-locally semicomplete digraphs
- The time-dependent rural postman problem: polyhedral results
- Causality, conditional independence, and graphical separation in settable systems
- Richardson's theorem in \(H\)-coloured digraphs
- Classification of real Bott manifolds and acyclic digraphs
- Approximation algorithms for orienting mixed graphs
- A note on leader election in directed split-stars and directed alternating group graphs
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation
- Minimum flow variation in maximum flows
- Miscellaneous digraph classes
- A Polyhedral Description of Kernels
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Maximum size of digraphs with some parameters
- scientific article; zbMATH DE number 3841916 (Why is no real title available?)
- Edge-disjoint Hamiltonian cycles in hypertournaments
- Niche hypergraphs
- On arc-traceable tournaments
- A characterization of locally semicomplete CKI-digraphs
- Transitive convex subsets in large tournaments
- On the pathwidth of almost semicomplete digraphs
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)
