Locally Semicomplete Digraphs and Generalizations
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 804599
- scientific article; zbMATH DE number 871182
- On the structure of locally semicomplete digraphs
- A classification of locally semicomplete digraphs
- Locally semicomplete digraphs: A generalization of tournaments
- Connectivity properties of locally semicomplete digraphs
- Locally semicomplete digraphs that are complementarym-pancyclic
- On complementary cycles in locally semicomplete digraphs
- scientific article; zbMATH DE number 800098
- A characterization of locally semicomplete CKI-digraphs
Cites work
- scientific article; zbMATH DE number 3465337 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1229627 (Why is no real title available?)
- scientific article; zbMATH DE number 1334633 (Why is no real title available?)
- scientific article; zbMATH DE number 1764950 (Why is no real title available?)
- scientific article; zbMATH DE number 804599 (Why is no real title available?)
- scientific article; zbMATH DE number 908788 (Why is no real title available?)
- scientific article; zbMATH DE number 3303831 (Why is no real title available?)
- scientific article; zbMATH DE number 3106184 (Why is no real title available?)
- A Note on the Number of 4-Circuits in a Tournament
- A characterization of locally semicomplete CKI-digraphs
- A classification of locally semicomplete digraphs
- A combinatorial problem in logic
- A local tournament contains a vertex whose out-arcs are pseudo-girth-pancyclic
- A note on spanning local tournaments in locally semicomplete digraphs
- A note on vertex pancyclic oriented graphs
- A sufficient condition for a digraph to be positive-round
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- All 2-connected in-tournaments that are cycle complementary
- Approximating minimum feedback sets and multicuts in directed graphs
- Arc-disjoint Hamiltonian paths in non-round decomposable local tournaments
- Arc-disjoint in- and out-branchings with the same root in locally semicomplete digraphs
- Arc-disjoint paths in decomposable digraphs
- Decomposing locally semicomplete digraphs into strong spanning subdigraphs
- Digraphs
- Digraphs with the path‐merging property
- Disjoint paths in decomposable digraphs
- Disjoint quasi-kernels in digraphs
- Edge-disjoint in- and out-branchings in tournaments and related path problems
- Every strong digraph has a spanning strong subgraph with at most \(n+2\alpha-2\) arcs
- Extending cycles in directed graphs
- Fast FAST
- Fast algorithms for finding Hamiltonian paths and cycles in in-tournament digraphs
- Finding complementary cycles in locally semicomplete digraphs
- Generalizations of tournaments: A survey
- In-tournament digraphs
- In-tournaments and semicomplete multipartite digraphs
- Introduction to algorithms
- Kernels for feedback arc set in tournaments
- Kings in locally semicomplete digraphs
- LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
- Linkages in locally semicomplete digraphs and quasi-transitive digraphs
- Locally semicomplete digraphs that are complementarym-pancyclic
- Locally semicomplete digraphs: A generalization of tournaments
- On complementary cycles in locally semicomplete digraphs
- On the number of quasi-kernels in digraphs
- On the structure of local tournaments
- On the structure of locally semicomplete digraphs
- Orientations of digraphs almost preserving diameter
- Pancyclic in-tournaments
- Pancyclic orderings of in-tournaments
- Short proofs of classical theorems
- Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments
- Spanning local tournaments in locally semicomplete digraphs
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
- Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
- Strongly Hamiltonian-connected locally semicomplete digraphs
- Sufficient Conditions for Circuits in Graphs†
- The Complexity of Colouring by Semicomplete Digraphs
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
- The minimum spanning strong subdigraph problem is fixed parameter tractable
- Une condition suffisante d'existence d'un circuit Hamiltonien dans un graphe oriente
- Vertex 6-pancyclic in-tournaments
- Vertex pancyclic in-tournaments
- Weakly Hamiltonian-connected locally semicomplete digraphs
- k-ordered graphs \& out-arc pancyclicity on digraphs
- \(k\)-strong spanning local tournaments in locally semicomplete digraphs
Cited in
(23)- Strongly Hamiltonian-connected locally semicomplete digraphs
- Compositions of digraphs: a survey
- The structure of strong arc-locally in-semicomplete digraphs
- A classification of all arc-locally semicomplete digraphs
- scientific article; zbMATH DE number 857686 (Why is no real title available?)
- On the Complexity of Singly Connected Vertex Deletion
- A classification of locally semicomplete digraphs
- A note on spanning local tournaments in locally semicomplete digraphs
- Arc-disjoint in- and out-branchings rooted at the same vertex in compositions of digraphs
- On the structure of locally semicomplete digraphs
- Sufficient conditions for locally in (out)-semicomplete digraphs to be traceable
- scientific article; zbMATH DE number 804599 (Why is no real title available?)
- Traceable property of extended locally in(out)-semicomplete digraph
- Weakly Hamiltonian-connected locally semicomplete digraphs
- On the complexity of singly connected vertex deletion
- Locally semicomplete digraphs: A generalization of tournaments
- Locally restricted compositions. IV. Nearly free large parts and gap-freeness
- A classification of arc-locally semicomplete digraphs
- A sufficient condition for a digraph to be positive-round
- Steiner type problems for digraphs that are locally semicomplete or extended semicomplete
- Pancyclicity in strong k-quasi-transitive digraphs of large diameter
- Traceable properties of locally in/out-semicomplete digraph
- Finding complementary cycles in locally semicomplete digraphs
This page was built for publication: Locally Semicomplete Digraphs and Generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3120438)
