scientific article; zbMATH DE number 1764950

zbMath1001.05002MaRDI QIDQ4539516

Gregory Gutin, Jörgen Bang-Jensen

Publication date: 9 July 2002

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

Mathematics Subject Classification ID

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)

Twin signed total Roman domatic numbers in digraphs ⋮ Disjoint cycles of different lengths in 3-regular digraphs ⋮ On the strong \(n\)-partite tournaments with exactly two cycles of length \(n-1\) ⋮ Kernels by monochromatic paths and color-perfect digraphs ⋮ Equilibria for games with combined qualitative and quantitative objectives ⋮ Efficient numerical methods for gas network modeling and simulation ⋮ NMR assignment through linear programming ⋮ Lexicographic product of digraphs and related boundary-type sets ⋮ Unnamed Item ⋮ On a resource-constrained scheduling problem with application to distributed systems reconfiguration ⋮ Arc fault tolerance of Cartesian product of regular digraphs on super-restricted arc-connectivity ⋮ Unnamed Item ⋮ Paths and trails in edge-colored graphs ⋮ Unnamed Item ⋮ On Making Directed Graphs Transitive ⋮ Implicit power indices for measuring indirect control in corporate structures ⋮ Reachability problems in edge-colored digraphs ⋮ A new sufficient condition for a Digraph to be Hamiltonian-A proof of Manoussakis Conjecture ⋮ Cycles and communicating classes in membrane systems and molecular dynamics ⋮ Congestion-Free Rerouting of Flows on DAGs ⋮ The strong convexity spectra of grids ⋮ Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two ⋮ On min-max pair in tournaments ⋮ Approximation algorithms for orienting mixed graphs ⋮ A linear-time parameterized algorithm for computing the width of a DAG ⋮ On the existence and number of (\(k+1\))-kings in \(k\)-quasi-transitive digraphs ⋮ Consensus of second-order multi-agent systems with disturbances generated by nonlinear exosystems under switching topologies ⋮ Complementary cycles in regular bipartite tournaments ⋮ Entropy and the complexity of graphs revisited ⋮ A calculus for measuring the elegance of abstract graphs ⋮ On the fixed-parameter tractability of the maximum connectivity improvement problem ⋮ Failed zero forcing and critical sets on directed graphs ⋮ \(k\)-ary spanning trees contained in tournaments ⋮ DNA sequence assembly involving an acyclic graph model ⋮ Synthesizing bounded-time 2-phase fault recovery ⋮ Vertex-disjoint cycles in regular tournaments ⋮ From kernels in directed graphs to fixed points and negative cycles in Boolean networks ⋮ Covering small subgraphs of (hyper)tournaments with spanning acyclic subgraphs ⋮ Feedback Vertex Sets in Tournaments ⋮ \(k\)-kernels in \(k\)-transitive and \(k\)-quasi-transitive digraphs ⋮ Sufficient conditions for the existence of spanning colored trees in edge-colored graphs ⋮ Cycles in \(k\)-traceable oriented graphs ⋮ On blow-ups and injectivity of quivers ⋮ The Turán number of directed paths and oriented cycles ⋮ Symbolic Powers of Monomial Ideals and Cohen-Macaulay Vertex-Weighted Digraphs ⋮ Unnamed Item ⋮ On the complexity of the 3-kernel problem in some classes of digraphs ⋮ Secure message transmission on directed networks ⋮ On the \(n\)-partite tournaments with exactly \(n - m + 1\) cycles of length \(m\) ⋮ Adaptive coordinated attitude control for spacecraft formation with saturating actuators and unknown inertia ⋮ Some remarks on the structure of strong \(k\)-transitive digraphs ⋮ Hamiltonian cycle problem in strong \(k\)-quasi-transitive digraphs with large diameter ⋮ Three-dimensional circular formations via set stabilization ⋮ Boundary vertices of Cartesian product of directed graphs ⋮ Some results on 4-transitive digraphs ⋮ Adaptive fault‐tolerant attitude tracking control for spacecraft formation with unknown inertia ⋮ \(k\)-distinct in- and out-branchings in digraphs ⋮ Cycles in a tournament with pairwise zero, one or two given vertices in common ⋮ Computing the largest H-eigenvalue of large-scale tensors generated from directed hypergraphs ⋮ Rainbow connectivity of cacti and of some infinite digraphs ⋮ Incentives and the structure of communication ⋮ An effective algorithm for obtaining the minimal cost pair of disjoint paths with dual arc costs ⋮ The minimum feedback arc set problem and the acyclic disconnection for graphs ⋮ Critical kernel imperfect problem in generalizations of bipartite tournaments ⋮ The cycle structure for directed graphs on surfaces ⋮ Links in edge-colored graphs ⋮ Cycling in ecological networks: Finn's index revisited ⋮ An effective algorithm for obtaining the whole set of minimal cost pairs of disjoint paths with dual arc costs ⋮ Fixed-parameter tractability results for feedback set problems in tournaments ⋮ Vertex-disjoint directed cycles of prescribed length in tournaments with given minimum out-degree and in-degree ⋮ A new bound for a particular case of the Caccetta-Häggkvist conjecture ⋮ Convergence analysis of SP-iteration for \(G\)-nonexpansive mappings with directed graphs ⋮ Phylogenetic networks from multi-labelled trees ⋮ Cycles and paths in edge‐colored graphs with given degrees ⋮ Exact localisations of feedback sets ⋮ A sub-exponential FPT algorithm and a polynomial kernel for minimum directed bisection on semicomplete digraphs ⋮ On the existence of \((k,l)\)-kernels in infinite digraphs: a survey ⋮ Sufficient conditions for a digraph to admit a \((1, \leq \ell )\)-identifying code ⋮ A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture ⋮ Fracture and fragmentation of simplicial finite element meshes using graphs ⋮ Projective dimension and regularity of powers of edge ideals of vertex-weighted rooted forests ⋮ Returnability in complex directed networks (digraphs) ⋮ A graph-theoretic perspective on the links-to-concepts ratio expected in cognitive maps ⋮ A note on dominating pair degree condition for Hamiltonian cycles in balanced bipartite digraphs ⋮ Maximum colored trees in edge-colored graphs ⋮ A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS ⋮ Projective dimension and regularity of edge ideals of some weighted oriented graphs ⋮ Chromatic polynomials of oriented graphs ⋮ All Feedback Arc Sets of a Random Turán Tournament Have $\lfloor {n}/{k}\rfloor-{k}+1$ Disjoint ${k}$-Cliques (and This Is Tight) ⋮ On detour homogeneous digraphs ⋮ On the complexity of the \(k\)-kernel problem on cyclically \(k\)-partite digraphs ⋮ On the \(k\)-domination number of digraphs ⋮ Locally Semicomplete Digraphs and Generalizations ⋮ Quasi-Transitive Digraphs and Their Extensions ⋮ A note on min-max pair in tournaments ⋮ \((k-1)\)-kernels in strong \(k\)-transitive digraphs ⋮ Two proofs of Bermond-Thomassen conjecture for regular tournaments ⋮ Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs ⋮ The complexity of automated addition of fault-tolerance without explicit legitimate states ⋮ Game-perfect semiorientations of forests

This page was built for publication: