scientific article; zbMATH DE number 1498519

Publication date: 31 August 2000

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Related Items

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, Parameterized algorithms for feedback set problems and their duals in tournaments, Idempotent and co-idempotent stack filters and min--max operators., Vertex-disjoint cycles of different lengths in multipartite tournaments, Parameterized complexity of $d$-hitting set with quotas, The complexity of Boolean matrix root computation, Richardson's theorem in $H$-coloured digraphs, Finding next-to-shortest paths in a graph, Minimum average distance of strong orientations of graphs, Competition hypergraphs, Competition hypergraphs of products of digraphs, Minimum cost homomorphism dichotomy for oriented cycles, Computing sparse and dense realizations of reaction kinetic systems, Cycles and transitivity by monochromatic paths in arc-coloured digraphs, Maximum size of digraphs with some parameters, Niche hypergraphs, A characterization of locally semicomplete CKI-digraphs, Every cycle-connected multipartite tournament with $\delta\geq 2$ contains at least two universal ARCS, $H$-kernels in infinite digraphs, Gibbsian stationary non-equilibrium states, Characterization of signed line digraphs, The multi-facility median problem with Pos/Neg weights on general graphs, An algorithm for a decomposition of weighted digraphs: with applications to life cycle analysis in ecology, Robustness of minimum cost arborescences, Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3, Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor, The acyclic and $\overset\rightarrow C_3$-free disconnection of tournaments, Commutativity conditions for groups arising from acyclic directed graphs and posets, The (1,2)-step competition graph of a tournament, Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem, Structural properties of minimal strong digraphs versus trees, $\Pi$-kernels in digraphs, Two results on the digraph chromatic number, Every strong digraph has a spanning strong subgraph with at most $n+2\alpha-2$ arcs, A lower bound on the Hamiltonian path completion number of a line graph, A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks, Full-rank affine invariant submanifolds, Immersing complete digraphs, A classification of all arc-locally semicomplete digraphs, Sufficient conditions for a balanced bipartite digraph to be even pancyclic, Maximum distance between Slater orders and Copeland orders of tournaments, Products of digraphs and their competition graphs, Normal Helly circular-arc graphs and its subclasses, Digraph decompositions and monotonicity in digraph searching, A post-improvement procedure for the mixed load school bus routing problem, On the sizes of graphs and their powers: the undirected case, Algorithms and complexity results for persuasive argumentation, A computational perspective on network coding, Minimum cycle factors in quasi-transitive digraphs, DNA labelled graphs with DNA computing, Tree-based networks: characterisations, metrics, and support trees, Sufficient conditions for Hamiltonian cycles in bipartite digraphs, Social choice without the Pareto principle under weak independence, Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz, Towards a theory of game-based non-equilibrium control systems, On panchromatic digraphs and the panchromatic number, Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach, Colorings and spectral radius of digraphs, Structural and spectral properties of minimal strong digraphs, Componentwise complementary cycles in multipartite tournaments, Cost and accuracy aware scientific workflow retrieval based on distance measure, Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion, On the parameterized complexity of reconfiguration problems, Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree, A construction of uniquely $n$-colorable digraphs with arbitrarily large digirth, Eigenvalues and colorings of digraphs, Spectral radius of strongly connected digraphs, The generalized distance matrix of digraphs, Kernels by monochromatic paths in digraphs with covering number 2, Finding complementary cycles in locally semicomplete digraphs, A memetic algorithm for the generalized traveling salesman problem, An updated survey on the linear ordering problem for weighted or unweighted tournaments, The Hoàng-Reed conjecture for $\delta ^{+}=3$, Super-connected and super-arc-connected Cartesian product of digraphs, Heuristics for the central tree problem, Double-super-connected digraphs, On the structure of strong 3-quasi-transitive digraphs, Openly disjoint circuits through a vertex in regular digraphs, The bondage number in complete $t$-partite digraphs, The restricted arc connectivity of Cartesian product digraphs, Vertex disjoint cycles of different lengths in $d$-arc-dominated digraphs, Making choices with a binary relation: relative choice axioms and transitive closures, Extension of Gyárfás-Sumner conjecture to digraphs, An efficient distributed algorithm for canonical labeling on directed split-stars, Rainbow triangles in arc-colored tournaments, On $d$-arc-dominated oriented graphs, The number of out-pancyclic vertices in a strong tournament, On the existence of noncritical vertices in digraphs, Solving the minimum flow problem with interval bounds and flows, 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, Disproof of a conjecture on the rainbow triangles in arc-colored digraphs, Paths in $[ h , k $-bipartite hypertournaments], Used car salesman problem: a differential auction-barter market, Infinite quasi-transitive digraphs with domination number 2, The energy of the alphabet model, Rainbow triangles in arc-colored digraphs, Degree complete graphs, Strong subtournaments and cycles of multipartite tournaments, On the Pathwidth of Almost Semicomplete Digraphs, Minimal autocatalytic networks, Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments, H-absorbence and H-independence in 3-quasi-transitive H-coloured digraphs., Characterizations for some types of DNA graphs, A Polyhedral Description of Kernels, Causality, Conditional Independence, and Graphical Separation in Settable Systems, 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, Resolutions of convex geometries, Proper Hamiltonian paths in edge-coloured multigraphs, Vertex-disjoint quadrilaterals in multigraphs, Decomposing and colouring some locally semicomplete digraphs, Partition of regular balanced $c$-tournaments into strongly connected $c$-tournaments, Classification of real Bott manifolds and acyclic digraphs, Extremal total distance of graphs of given radius I, Solving the edge‐disjoint paths problem using a two‐stage method, The Hamiltonicity on the competition graphs of round digraphs, Vertex-disjoint cycles of different lengths in local tournaments, Adjacencies on random ordering polytopes and flow polytopes, Independent sets and non-augmentable paths in generalizations of tournaments, A bi-preference interplay between transitivity and completeness: reformulating and extending Schmeidler's theorem, 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, Disjoint quasi-kernels in digraphs, Functional integration of ecological networks through pathway proliferation, The distance spectral radius of digraphs, Global stability for the 2-dimensional logistic map, On persistent directed graphs, Existence of openly disjoint circuits through a vertex, Vertex-pancyclicity of hypertournaments, Choice resolutions, Voting Procedures, Complexity of, Global stability for the three-dimensional logistic map, Directed Graphs Without Short Cycles, Approximation Algorithms for Orienting Mixed Graphs, On a cyclic connectivity property of directed graphs, Conditions on the regularity of balanced $c$-partite tournaments for the existence of strong subtournaments with high minimum degree, On the number of noncritical vertices in strongly connected digraphs, Spectral radius and signless Laplacian spectral radius of strongly connected digraphs, Computational complexity of isothermic DNA sequencing by hybridization, Embedding on alphabet overlap digraphs, Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments, 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, 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, On 3-regular digraphs of girth 4, How to recycle your facets, Niche hypergraphs of products of digraphs, MINIMUM FLOW VARIATION IN MAXIMUM FLOWS, Algorithms for finding maximum transitive subtournaments, CKI-digraphs, generalized sums and partitions of digraphs, A multi-city epidemic model, On vertex disjoint cycles of different lengths in 3-regular digraphs, Edge-disjoint Hamiltonian cycles in hypertournaments, Minimal feedback vertex sets in directed split‐stars, Short proofs of classical theorems, Expressing Extension-Based Semantics Based on Stratified Minimal Models, Weakening arcs in tournaments, Stochastic monotonicity from an Eulerian viewpoint, The Parity Hamiltonian Cycle Problem in Directed Graphs, Properly Coloured Cycles and Paths: Results and Open Problems, Disjoint $A$-paths in digraphs, On arc-traceable tournaments, A classification of arc-locally semicomplete digraphs, On edge-colored graphs covered by properly colored cycles, Tournaments and Bipartite Tournaments without Vertex Disjoint Cycles of Different Lengths, High connectivity keeping sets in graphs and digraphs, Unnamed Item, Solving the selective multi-category parallel-servicing problem, An integer programming approach for the Chinese postman problem with time-dependent travel time, The time-dependent rural postman problem: polyhedral results, Transitive convex subsets in large tournaments, 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