Compositions of digraphs: a survey
From MaRDI portal
Cites work
- \((k + 1)\)-kernels and the number of \(k\)-kings in \(k\)-quasi-transitive digraphs
- k-distinct in- and out-branchings in digraphs
- A classification of locally semicomplete digraphs
- A sufficient condition for a semicomplete multipartite digraph to be Hamiltonian
- Approximating the Minimum Equivalent Digraph
- Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
- Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
- Arc-disjoint out- and in-branchings in compositions of digraphs
- Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs
- Arc-disjoint strong spanning subdigraphs of semicomplete compositions
- Characterization of vertex pancyclic and pancyclic ordinary complete multipartite digraphs
- Cycles in multipartite tournaments: Results and problems
- Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Digraphs
- Digraphs products
- Directed cycle k-connectivity of complete digraphs and complete regular bipartite digraphs
- Directed Steiner tree packing and directed tree connectivity
- Disjoint quasi-kernels in digraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- Every vertex a king
- Expressive power of digraph solvability
- Finding a Longest Path in a Complete Multipartite Digraph
- Finding kernels or solving SAT
- Generalizations of tournaments: A survey
- Graph theory
- Hamiltonian-connected tournaments
- scientific article; zbMATH DE number 3838057 (Why is no real title available?)
- scientific article; zbMATH DE number 4164908 (Why is no real title available?)
- scientific article; zbMATH DE number 4085689 (Why is no real title available?)
- scientific article; zbMATH DE number 3465337 (Why is no real title available?)
- scientific article; zbMATH DE number 731861 (Why is no real title available?)
- scientific article; zbMATH DE number 863469 (Why is no real title available?)
- scientific article; zbMATH DE number 3205929 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- Kings in quasi-transitive digraphs
- Kings in semicomplete multipartite digraphs
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Locally Semicomplete Digraphs and Generalizations
- Longest path partitions in generalizations of tournaments
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs
- Minimum cycle factors in quasi-transitive digraphs
- Nombre chromatique et plus longs chemins d'un graphe
- Number of 4-kings in bipartite tournaments with no 3-kings
- On cycles in multipartite tournaments
- On monochromatic paths in edge-coloured digraphs
- On monochromatic paths in m-coloured tournaments
- On the number of quasi-kernels in digraphs
- Packing strong subgraph in digraphs
- Perfect graphs, kernels, and cores of cooperative games
- Perfect out-forest problem and directed Steiner cycle packing problem
- Quasi‐transitive digraphs
- Semicomplete compositions of digraphs
- Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs
- Strong subgraph k‐connectivity
- Strong subgraph connectivity of digraphs
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- The number of kings in a multipartite tournament
- The Path Partition Conjecture is true for some generalizations of tournaments
- The Transitive Reduction of a Directed Graph
- Toppling kings in a tournament by introducing new kings
- Tournaments and Semicomplete Digraphs
This page was built for publication: Compositions of digraphs: a survey
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6965784)
