scientific article; zbMATH DE number 1498519
From MaRDI portal
Publication:4500916
Recommendations
Cited in
(only showing first 100 items - show all)- 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
- Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
- The representation of partially-concurrent open shop problems
- On the sizes of graphs and their powers: the undirected case
- Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
- Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
- On the structure of the adjacency matrix of the line digraph of a regular digraph
- Adjacencies on random ordering polytopes and flow polytopes
- Conditions on the regularity of balanced \(c\)-partite tournaments for the existence of strong subtournaments with high minimum degree
- Directed graphs without short cycles
- 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
- Richardson's theorem in \(H\)-coloured digraphs
- A note on leader election in directed split-stars and directed alternating group graphs
- A note on the spectral characterization of strongly connected bicyclic digraphs
- Parameterized complexity of d-hitting set with quotas
- Gibbsian stationary non-equilibrium states
- On the structure of strong 3-quasi-transitive digraphs
- Digraphs
- Classes of directed graphs
- Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
- Two results on the digraph chromatic number
- Approximation algorithms for orienting mixed graphs
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- Used car salesman problem: a differential auction-barter market
- Paths in \([ h , k ]\)-bipartite hypertournaments
- Spectral radius of digraphs with given dichromatic number
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- Idempotent and co-idempotent stack filters and min--max operators.
- The (1,2)-step competition graph of a tournament
- Vertex-disjoint cycles of different lengths in local tournaments
- Causality, conditional independence, and graphical separation in settable systems
- Expressing Extension-Based Semantics Based on Stratified Minimal Models
- Algorithms for finding maximum transitive subtournaments
- Minimum cost homomorphism dichotomy for oriented cycles
- Solving the edge‐disjoint paths problem using a two‐stage method
- Heuristics for the central tree problem
- Openly disjoint circuits through a vertex in regular digraphs
- Edge-disjoint Hamiltonian cycles in hypertournaments
- The bondage number in complete \(t\)-partite digraphs
- The number of out-pancyclic vertices in a strong tournament
- Kernels by monochromatic paths in digraphs with covering number 2
- T-irreducible extension of polygonal digraphs
- Strong subtournaments and cycles of multipartite tournaments
- Products of digraphs and their competition graphs
- Tournaments and bipartite tournaments without vertex disjoint cycles of different lengths
- The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
- Voting procedures, complexity of
- Vertex-pancyclicity of hypertournaments
- Eigenvalues and colorings of digraphs
- Short proofs of classical theorems
- Almost 2-SAT is fixed-parameter tractable
- A classification of all arc-locally semicomplete digraphs
- Immersing complete digraphs
- Choice resolutions
- Tree-based networks: characterisations, metrics, and support trees
- Triangle packings and 1-factors in oriented graphs
- Disjoint A-paths in digraphs
- Proper Hamiltonian cycles in edge-colored multigraphs
- Global stability for the 2-dimensional logistic map
- Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic
- Stochastic monotonicity from an Eulerian viewpoint
- Sufficient conditions for Hamiltonian cycles in bipartite digraphs
- Extension of Gyárfás-Sumner conjecture to digraphs
- The parity Hamiltonian cycle problem in directed graphs
- Choices and kernels in bipolar valued digraphs
- Cost and accuracy aware scientific workflow retrieval based on distance measure
- Minimal autocatalytic networks
- Extremal total distance of graphs of given radius I
- A duality for labeled graphs and factorizations with applications to graph embeddings and Hurwitz enumeration
- \(H\)-kernels in infinite digraphs
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Making choices with a binary relation: relative choice axioms and transitive closures
- A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem
- Robustness of minimum cost arborescences
- An extension of Richardson's theorem in m-colored digraphs
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
- A post-improvement procedure for the mixed load school bus routing problem
- On vertex disjoint cycles of different lengths in 3-regular digraphs
- The distance spectral radius of digraphs
- Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
- The restricted arc connectivity of Cartesian product digraphs
- On 3-regular digraphs without vertex disjoint cycles of different lengths
- On 3-regular digraphs of girth 4
- Computational complexity of isothermic DNA sequencing by hybridization
- Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
- On the pathwidth of almost semicomplete digraphs
- Structural properties of minimal strong digraphs versus trees
- Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
- On the vertices of a 3-partite tournament not in triangles
- Solving the selective multi-category parallel-servicing problem
- The energy of the alphabet model
- Convex sets in acyclic digraphs
- Sufficient conditions for super-arc-strongly connected oriented graphs
- Resolutions of convex geometries
- A memetic algorithm for the generalized traveling salesman problem
- Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
- The generalized distance matrix of 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)
