Tournaments and Semicomplete Digraphs (Q3120434): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-71840-8_2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2808898944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented trees in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths with two blocks in \(n\)-chromatic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint directed cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Out‐colourings of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2798999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of Each Length in Regular Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realization of certain generalized paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new rounding procedure for the assignment problem with applications to dense graph arrangement problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint in- and out-branchings in tournaments and related path problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3815328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree constrained 2-partitions of semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good 2-partitions of digraphs. II. Enumerable properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of tournaments: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding good 2-partitions of digraphs. I. Hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi‐transitive digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning <i>k</i>‐arc‐strong subdigraphs with few arcs in <i>k</i>‐arc‐strong tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adding and Reversing Arcs in Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning 2-strong tournaments in 3-strong semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-hamiltonian paths in semicomplete multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding complementary cycles in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Making a tournament \(k\)-arc-strong by reversing or deorienting arcs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong immersion is a well‐quasi‐ordering for semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of specified cycles in a tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles of different lengths in graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournaments and colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles in digraphs– a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle packing in (sparse) tournaments: approximation and kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paley graphs satisfy all first-order adjacency axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Powers of Hamilton cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs which contain all small graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5265408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diconnected Orientations and a Conjecture of Las Vergnas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs of classical theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2937517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landau's and Rado's theorems and partial tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3900086 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4192089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees with three leaves are (\(n+1\))-unavoidable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning vertices of a tournament into independent cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Second neighborhood via first neighborhood in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A well-quasi-order for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdivisions of oriented cycles in digraphs with large chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of Seymour vertices in random tournaments and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels for feedback arc set in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of all lengths in arc-3-cyclic semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3838208 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum cardinality of a consistent set of arcs in a random tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths with two blocks in \(k\)-chromatic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: About paths with two blocks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Remarks on the second neighborhood problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892341 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jungles, bundles, and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity of paths and circuits in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint paths in digraphs with bounded independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament pathwidth and topological containment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian dicycles avoiding prescribed arcs in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed vertex-connectivity augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal edge-coverings of pairs of sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the length of longest increasing subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quick approximation to matrices and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5808750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A counterexample to a conjecture on edge-coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871769 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4269428 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning local tournaments in locally semicomplete digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Out-arc pancyclicity of vertices in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of out-pancyclic vertices in a strong tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton Cycles in Oriented Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zur algebraischen Begründung der Graphentheorie. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unavoidability of trees with \(k\) leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian cycles in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic arcs and connectivity in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hoàng-Reed conjecture holds for tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on short cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long paths and cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse Spanning $k$-Connected Subgraphs in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact minimum degree condition for Hamilton cycles in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartitions of highly connected tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles with two blocks in <i>k</i>‐chromatic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743498 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of Sumner's universal tournament conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4601901 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition of a strong tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint cycles in regular tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest digraphs contained in all n-tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circulant tournaments of prime order are tight / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4892356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimax Theorem for Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 7/3-Approximation for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular colorings of edge-weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Subtournaments of a Tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585195 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex critical 4-dichromatic circulant tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3323980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly linked tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4756732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4390606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691764 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disproof of a conjecture of Erdös and moser on tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XX: Wagner's conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamiltonian circuits in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nombre chromatique et plus longs chemins d'un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tournaments free of large transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: On monochromatic paths in m-coloured tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3924220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementary cycles of all lengths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3904626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths and Cycles in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamilton circuits and paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3337490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Disjoint cycles in digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph decomposition with constraints on the connectivity and minimum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian-connected tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3915012 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly 2-connected orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-linkage problem for acyclic digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of each length in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Hoàng-Reed conjecture for \(\delta ^{+}=3\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pancyclic out-arcs of a vertex in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of pancyclic arcs in a <i>k</i>‐strong tournament / rank
 
Normal rank

Latest revision as of 10:24, 18 July 2024

scientific article
Language Label Description Also known as
English
Tournaments and Semicomplete Digraphs
scientific article

    Statements

    Tournaments and Semicomplete Digraphs (English)
    0 references
    0 references
    0 references
    4 March 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers