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 (only showing first 100 items - show all)

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 ⋮ 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

This page was built for publication: