scientific article; zbMATH DE number 1498519
From MaRDI portal
Publication:4500916
Recommendations
Cited in
(only showing first 100 items - show all)- On panchromatic digraphs and the panchromatic number
- Disjoint quasi-kernels in digraphs
- Degree complete graphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- Two results on the digraph chromatic number
- Prefix graphs and their applications
- Competition hypergraphs
- Minimum average distance of strong orientations of graphs
- Richardson's theorem in \(H\)-coloured digraphs
- Almost 2-SAT is fixed-parameter tractable
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Minimum cycle factors in quasi-transitive digraphs
- The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
- Kernels by monochromatic paths in digraphs with covering number 2
- A characterization of locally semicomplete CKI-digraphs
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
- Spectral radius of strongly connected digraphs
- Digraphs. Theory, algorithms and applications
- Towards a theory of game-based non-equilibrium control systems
- A classification of arc-locally semicomplete digraphs
- A multi-city epidemic model
- The restricted arc connectivity of Cartesian product digraphs
- T-irreducible extension of polygonal digraphs
- A classification of all arc-locally semicomplete digraphs
- Immersing complete digraphs
- Vertex-pancyclicity of hypertournaments
- On the structure of the adjacency matrix of the line digraph of a regular digraph
- Minimum flow variation in maximum flows
- Edge-disjoint Hamiltonian cycles in hypertournaments
- Digraph Decompositions and Eulerian Systems
- Parameterized algorithms for feedback set problems and their duals in tournaments
- On the structure of strong 3-quasi-transitive digraphs
- Algorithms for finding maximum transitive subtournaments
- Finding next-to-shortest paths in a graph
- On the sizes of graphs and their powers: the undirected case
- Longest path partitions in generalizations of tournaments
- Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS
- The (1,2)-step competition graph of a tournament
- Properly coloured cycles and paths: Results and open problems
- Algorithms and complexity results for persuasive argumentation
- Competition hypergraphs of products of digraphs
- Computing sparse and dense realizations of reaction kinetic systems
- CKI-digraphs, generalized sums and partitions of digraphs
- An efficient distributed algorithm for canonical labeling on directed split-stars
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
- Double-super-connected digraphs
- A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
- Triangle packings and 1-factors in oriented graphs
- Characterization of signed line digraphs
- Super-connected and super-arc-connected Cartesian product of digraphs
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- \(H\)-kernels in infinite digraphs
- Digraphs
- A memetic algorithm for the generalized traveling salesman problem
- Cycles and transitivity by monochromatic paths in arc-coloured digraphs
- Embedding on alphabet overlap digraphs
- Maximum size of digraphs with some parameters
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Independent sets and non-augmentable paths in generalizations of tournaments
- Approximation algorithms for orienting mixed graphs
- Solving the minimum flow problem with interval bounds and flows
- On a cyclic connectivity property of directed graphs
- Normal Helly circular-arc graphs and its subclasses
- Characterizations for some types of DNA graphs
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
- Niche hypergraphs
- Minimal feedback vertex sets in directed split‐stars
- 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
- Classification of real Bott manifolds and acyclic digraphs
- A post-improvement procedure for the mixed load school bus routing problem
- The multi-facility median problem with Pos/Neg weights on general graphs
- Eigenvalues and colorings of digraphs
- Algorithms for junctions in acyclic digraphs
- Social choice without the Pareto principle under weak independence
- DNA labelled graphs with DNA computing
- Transitive convex subsets in large tournaments
- Gibbsian stationary non-equilibrium states
- Directed graphs without short cycles
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
- The number of out-pancyclic vertices in a strong tournament
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
- An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology
- On arc-traceable tournaments
- Parameterized complexity of \(d\)-hitting set with quotas
- Computational complexity of isothermic DNA sequencing by hybridization
- Products of digraphs and their competition graphs
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Partition of regular balanced \(c\)-tournaments into strongly connected \(c\)-tournaments
- Choices and kernels in bipolar valued digraphs
- A lower bound on the Hamiltonian path completion number of a line graph
- Finding complementary cycles in locally semicomplete digraphs
- A framework for multi-robot node coverage in sensor networks
- Commutativity conditions for groups arising from acyclic directed graphs and posets
- How to recycle your facets
- On \(d\)-arc-dominated oriented graphs
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)
