scientific article; zbMATH DE number 1498519

zbMATH Open0958.05002MaRDI QIDQ4500916FDOQ4500916

Publication date: 31 August 2000

Title of this publication is not available (Why is that?)

Recommendations

Digraphs. Theory, algorithms and applications
Digraphs
Theory and Application of Graphs

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

Cited In (only showing first 100 items - show all)

Spectral radius and signless Laplacian spectral radius of strongly connected digraphs
The acyclic and \(\overset\rightarrow C_3\)-free disconnection of tournaments
On the structure of the adjacency matrix of the line digraph of a regular digraph
On the sizes of graphs and their powers: the undirected case
Digraphs
A note on the spectral characterization of strongly connected bicyclic 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
Richardson's theorem in \(H\)-coloured digraphs
On the structure of strong 3-quasi-transitive digraphs
Approximation algorithms for orienting mixed graphs
Hamiltonian cycles in a generalization of bipartite tournaments with a cycle factor
Two results on the digraph chromatic number
Title not available (Why is that?)
Algorithms for finding maximum transitive subtournaments
The (1,2)-step competition graph of a tournament
Edge-disjoint Hamiltonian cycles in hypertournaments
Kernels by monochromatic paths in digraphs with covering number 2
Vertex-pancyclicity of hypertournaments
T-irreducible extension of polygonal digraphs
Eigenvalues and colorings of digraphs
Almost 2-SAT is fixed-parameter tractable
A classification of all arc-locally semicomplete digraphs
Immersing complete digraphs
Triangle packings and 1-factors in oriented graphs
Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
\(H\)-kernels in infinite digraphs
A post-improvement procedure for the mixed load school bus routing problem
Two proofs of the Bermond-Thomassen conjecture for tournaments with bounded minimum in-degree
The restricted arc connectivity of Cartesian product digraphs
Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz
Realizing disjoint degree sequences of span at most two: a tractable discrete tomography problem
On the parameterized complexity of reconfiguration problems
Digraphs. Theory, algorithms and applications
A memetic algorithm for the generalized traveling salesman problem
Prefix graphs and their applications
Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets
Cycles and transitivity by monochromatic paths in arc-coloured digraphs
Embedding on alphabet overlap digraphs
Maximum size of digraphs with some parameters
Independent sets and non-augmentable paths in generalizations of tournaments
Longest path partitions in generalizations of tournaments
An updated survey on the linear ordering problem for weighted or unweighted tournaments
Super-connected and super-arc-connected Cartesian product of digraphs
Solving the minimum flow problem with interval bounds and flows
Characterizations for some types of DNA graphs
On panchromatic digraphs and the panchromatic number
Towards a theory of game-based non-equilibrium control systems
Properly coloured cycles and paths: Results and open problems
Niche hypergraphs
Double-super-connected digraphs
A linear programming approach to weak reversibility and linear conjugacy of chemical reaction networks
Minimal feedback vertex sets in directed split‐stars
Social choice without the Pareto principle under weak independence
Parameterized algorithms for feedback set problems and their duals in tournaments
Finding next-to-shortest paths in a graph
Minimum cycle factors in quasi-transitive digraphs
A characterization of locally semicomplete CKI-digraphs
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3
Every cycle-connected multipartite tournament with \(\delta\geq 2\) contains at least two universal ARCS
Competition hypergraphs of products of digraphs
Computing sparse and dense realizations of reaction kinetic systems
On a cyclic connectivity property of directed graphs
The multi-facility median problem with Pos/Neg weights on general graphs
An efficient distributed algorithm for canonical labeling on directed split-stars
Spectral radius of strongly connected digraphs
CKI-digraphs, generalized sums and partitions of digraphs
Disjoint quasi-kernels in digraphs
A classification of arc-locally semicomplete digraphs
Classification of real Bott manifolds and acyclic digraphs
Degree complete graphs
Minimum flow variation in maximum flows
Algorithms and complexity results for persuasive argumentation
Algorithms for junctions in acyclic digraphs
Competition hypergraphs
Minimum average distance of strong orientations of graphs
A multi-city epidemic model
Digraph Decompositions and Eulerian Systems
Characterization of signed line digraphs
Normal Helly circular-arc graphs and its subclasses
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
Conditions on the regularity of balanced \(c\)-partite tournaments for the existence of strong subtournaments with high minimum degree
Paths partition with prescribed beginnings in digraphs: A Chvátal-Erdős condition approach
Directed graphs without short cycles
Classes of directed graphs
Gibbsian stationary non-equilibrium states
Parameterized complexity of \(d\)-hitting set with quotas
Vertex-disjoint cycles of different lengths in local tournaments
Used car salesman problem: a differential auction-barter market
Minimum cost homomorphism dichotomy for oriented cycles
Heuristics for the central tree problem
Openly disjoint circuits through a vertex in regular digraphs
Strong subtournaments and cycles of multipartite tournaments
Voting procedures, complexity of
The bondage number in complete \(t\)-partite digraphs
The number of out-pancyclic vertices in a strong tournament
Products of digraphs and their competition graphs
The Hoàng-Reed conjecture for \(\delta ^{+}=3\)
Disjoint \(A\)-paths in digraphs
Each 3-strong tournament contains 3 vertices whose out-arcs are pancyclic

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)