Locally Semicomplete Digraphs and Generalizations
From MaRDI portal
Publication:3120438
DOI10.1007/978-3-319-71840-8_6zbMath1407.05100OpenAlexW2809065645MaRDI QIDQ3120438
Publication date: 4 March 2019
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_6
Related Items (4)
On the Complexity of Singly Connected Vertex Deletion ⋮ Pancyclicity in strong \(k\)-quasi-transitive digraphs of large diameter ⋮ Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs ⋮ On the complexity of singly connected vertex deletion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- A characterization of locally semicomplete CKI-digraphs
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Extending cycles in directed graphs
- Kernels for feedback arc set in tournaments
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- On the structure of locally semicomplete digraphs
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
- A combinatorial problem in logic
- A note on spanning local tournaments in locally semicomplete digraphs
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- In-tournament digraphs
- On complementary cycles in locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- Spanning local tournaments in locally semicomplete digraphs
- Approximating minimum feedback sets and multicuts in directed graphs
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Pancyclic orderings of in-tournaments
- Orientations of digraphs almost preserving diameter
- Finding complementary cycles in locally semicomplete digraphs
- Vertex 6-pancyclic in-tournaments
- On the structure of local tournaments
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
- All 2-connected in-tournaments that are cycle complementary
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- Vertex pancyclic in-tournaments
- The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
- Arc-Disjoint Paths in Decomposable Digraphs
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- Locally semicomplete digraphs: A generalization of tournaments
- A sufficient condition for a digraph to be positive-round
- Disjoint quasi-kernels in digraphs
- Kings in locally semicomplete digraphs
- Fast FAST
- A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
- The Complexity of Colouring by Semicomplete Digraphs
- A Note on the Number of 4-Circuits in a Tournament
- Generalizations of tournaments: A survey
- A note on vertex pancyclic oriented graphs
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- Short proofs of classical theorems
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
- LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
- On the number of quasi-kernels in digraphs
- Digraphs with the path‐merging property
- Locally semicomplete digraphs that are complementarym-pancyclic
- Weakly Hamiltonian-connected locally semicomplete digraphs
- Strongly Hamiltonian-connected locally semicomplete digraphs
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in‐tournaments
- Disjoint Paths in Decomposable Digraphs
- Digraphs
- Sufficient Conditions for Circuits in Graphs†
- Pancyclic in-tournaments
This page was built for publication: Locally Semicomplete Digraphs and Generalizations
