Classes of Directed Graphs

DOI10.1007/978-3-319-71840-8zbMath1398.05002OpenAlexW4248481689MaRDI QIDQ4606952

No author found.

Publication date: 9 March 2018

Published in: Springer Monographs in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-71840-8

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to combinatorics (05-06) Collections of articles of miscellaneous specific interest (00B15) Directed graphs (digraphs), tournaments (05C20)

Related Items (max. 100)

The knapsack problem with special neighbor constraints ⋮ Every \((13k - 6)\)-strong tournament with minimum out-degree at least \(28k - 13\) is \(k\)-linked ⋮ Computing directed Steiner path covers ⋮ On the Complexity of Singly Connected Vertex Deletion ⋮ Unwinding modal paradoxes on digraphs ⋮ Acyclic coloring parameterized by directed clique-width ⋮ Lexicographic product of digraphs and related boundary-type sets ⋮ Hamiltonian index of directed multigraph ⋮ Digraph of the full transformation semigroup ⋮ The smallest number of vertices in a 2-arc-strong digraph without pair of arc-disjoint in- and out-branchings ⋮ Directed width parameters on semicomplete digraphs ⋮ Component order connectivity in directed graphs ⋮ Extended path partition conjecture for semicomplete and acyclic compositions ⋮ Adapting the Directed Grid Theorem into an FPT Algorithm ⋮ Decomposing and colouring some locally semicomplete digraphs ⋮ Isotropy quotients of Hopf algebroids and the fundamental groupoid of digraphs ⋮ A minimum semi-degree sufficient condition for one-to-many disjoint path covers in semicomplete digraphs ⋮ Results on the small quasi-kernel conjecture ⋮ \((H, k)\)-reachability in \(H\)-arc-colored digraphs ⋮ Spanning eulerian subdigraphs in semicomplete digraphs ⋮ On the spectral radius of the generalized adjacency matrix of a digraph ⋮ On coloring digraphs with forbidden induced subgraphs ⋮ Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2 ⋮ New hereditary and mutation-invariant properties arising from forks ⋮ Twin-distance-hereditary digraphs ⋮ \(\mathrm{Quasi}_{\mathrm{ps}}\)-pancyclicity of regular multipartite tournament ⋮ A System of Interaction and Structure III: The Complexity of BV and Pomset Logic ⋮ Excluding a planar matching minor in bipartite graphs ⋮ Geometric and spectral analysis on weighted digraphs ⋮ Classes of intersection digraphs with good algorithmic properties ⋮ Improved results on linkage problems ⋮ Arc-disjoint Hamiltonian paths in strong round decomposable local tournaments ⋮ Solutions for subset sum problems with special digraph constraints ⋮ How to compute digraph width measures on directed co-graphs ⋮ Unnamed Item ⋮ Homomorphisms to digraphs with large girth and oriented colorings of minimal series-parallel digraphs ⋮ Efficient computation of the oriented chromatic number of recursively defined digraphs ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Component order connectivity in directed graphs ⋮ Chordality of locally semicomplete and weakly quasi-transitive digraphs ⋮ On characterizations for subclasses of directed co-graphs ⋮ Efficient algorithms for measuring the funnel-likeness of DAGs ⋮ Extension of Gyárfás-Sumner conjecture to digraphs ⋮ On 1-factors with prescribed lengths in tournaments ⋮ Digraphs with proper connection number two ⋮ Oriented bipartite graphs and the Goldbach graph ⋮ The directed 2-linkage problem with length constraints ⋮ A relaxation of the directed disjoint paths problem: a global congestion metric helps ⋮ Boundary-type sets of strong product of directed graphs ⋮ Transformation semigroups generated by semicomplete digraphs ⋮ Comparing linear width parameters for directed graphs ⋮ Spanning acyclic subdigraphs and strong \(t\)-panconnectivity of tournaments ⋮ Smallest number of vertices in a 2-arc-strong digraph without good pairs ⋮ On the complexity of singly connected vertex deletion ⋮ Weak-odd chromatic index of special digraph classes

This page was built for publication: Classes of Directed Graphs