Classes of directed graphs
From MaRDI portal
Publication:4606952
Recommendations
Cited in
(77)- Digraph of the full transformation semigroup
- Center of Cartesian and strong product of digraphs
- \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament
- scientific article; zbMATH DE number 7324139 (Why is no real title available?)
- Weak-odd chromatic index of special digraph classes
- Unwinding modal paradoxes on digraphs
- Acyclic coloring parameterized by directed clique-width
- A half-integral Erdős-Pósa theorem for directed odd cycles
- Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
- A System of Interaction and Structure III: The Complexity of BV and Pomset Logic
- Answering two OPAC problems involving Banff quivers
- Digraphs in which every t vertices have exactly common out-neighbors
- Excluding a planar matching minor in bipartite graphs
- Homeostasis in input-output networks: structure, classification and applications
- On the parameterized complexity of controlling amendment and successive winners
- (k,H)-kernels in nearly tournaments
- Twin-distance-hereditary digraphs
- Every (13k - 6)-strong tournament with minimum out-degree at least 28k - 13 is k-linked
- Computing directed Steiner path covers
- Efficient computation of the oriented chromatic number of recursively defined digraphs
- Results on the small quasi-kernel conjecture
- Lexicographic product of digraphs and related boundary-type sets
- Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs
- Extension of Gyárfás-Sumner conjecture to digraphs
- Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments
- A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs
- \((H, k)\)-reachability in \(H\)-arc-colored digraphs
- On the Complexity of Singly Connected Vertex Deletion
- Chordality of locally semicomplete and weakly quasi-transitive digraphs
- On characterizations for subclasses of directed co-graphs
- A characterization of rich \(c\)-partite \((c \geq 7)\) tournaments without \((c + 2)\)-cycles
- Hamiltonian index of directed multigraph
- Bounds on maximum weight directed cut
- On the complexity of minimizing energy consumption of partitioning DAG tasks
- Transformation semigroups generated by semicomplete digraphs
- Comparing linear width parameters for directed graphs
- Solutions for subset sum problems with special digraph constraints
- The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings
- Digraphs with proper connection number two
- Directed width parameters on semicomplete digraphs
- \(\mathrm{Quasi}_{\mathrm{nl}}\)-arc-pancyclic regular multipartite tournaments
- Adapting the directed grid theorem into an FPT algorithm
- Constant congestion linkages in polynomially strong digraphs in polynomial time
- Oriented bipartite graphs and the Goldbach graph
- Geometric and spectral analysis on weighted digraphs
- Extended path partition conjecture for semicomplete and acyclic compositions
- A relaxation of the directed disjoint paths problem: a global congestion metric helps
- The knapsack problem with special neighbor constraints
- Classes of intersection digraphs with good algorithmic properties
- scientific article; zbMATH DE number 887760 (Why is no real title available?)
- Decomposing and colouring some locally semicomplete digraphs
- Isotropy quotients of Hopf algebroids and the fundamental groupoid of digraphs
- New Menger-like dualities in digraphs and applications to half-integral linkages
- How to compute digraph width measures on directed co-graphs
- On the complexity of singly connected vertex deletion
- On using SAT solvers for graph computations
- Spanning eulerian subdigraphs in semicomplete digraphs
- Line graphs and line digraphs
- Anti-pancyclic arcs in strong tournaments
- Boundary-type sets of strong product of directed graphs
- On coloring digraphs with forbidden induced subgraphs
- Second neighborhood via probabilistic argument
- On 1-factors with prescribed lengths in tournaments
- Some machines defined by directed graphs
- The directed 2-linkage problem with length constraints
- Graph Classes: A Survey
- Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments
- Component order connectivity in directed graphs
- Component order connectivity in directed graphs
- Improved results on linkage problems
- On the spectral radius of the generalized adjacency matrix of a digraph
- New hereditary and mutation-invariant properties arising from forks
- Directed graphs and substitutions
- Smallest number of vertices in a 2-arc-strong digraph without good pairs
- Center and periphery of lexicographic product of digraphs
- Critical kernel imperfectness in 4-quasi-transitive digraphs and 4-anti-transitive digraphs of small diameter
- Pancyclicity in strong k-quasi-transitive digraphs of large diameter
This page was built for publication: Classes of directed graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4606952)
