Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Tournaments and Semicomplete Digraphs - MaRDI portal

Tournaments and Semicomplete Digraphs (Q3120434)

From MaRDI portal

Jump to:navigation, search

scientific article

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

Statements

scholarly article

0 references

Tournaments and Semicomplete Digraphs (English)

0 references

Frédéric Havet

0 references

Jörgen Bang-Jensen

0 references

Springer Monographs in Mathematics

0 references

publication date

4 March 2019

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-71840-8_2

0 references

Oriented trees in digraphs

0 references

Paths with two blocks in \(n\)-chromatic digraphs

0 references

Aggregating inconsistent information

0 references

Disjoint directed cycles

0 references

Ranking Tournaments

0 references

Out‐colourings of digraphs

0 references

0 references

0 references

0 references

0 references

0 references

Cycles of Each Length in Regular Tournaments

0 references

Realization of certain generalized paths in tournaments

0 references

A conjecture of Neumann-Lara on infinite families of \(r\)-dichromatic circulant tournaments

0 references

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

0 references

Edge-disjoint in- and out-branchings in tournaments and related path problems

0 references

0 references

Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs

0 references

Disjoint 3‐Cycles in Tournaments: A Proof of The Bermond–Thomassen Conjecture for Tournaments

0 references

Degree constrained 2-partitions of semicomplete digraphs

0 references

Finding good 2-partitions of digraphs. II. Enumerable properties

0 references

0 references

Generalizations of tournaments: A survey

0 references

0 references

Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments

0 references

Finding good 2-partitions of digraphs. I. Hereditary properties

0 references

Quasi‐transitive digraphs

0 references

Spanning <i>k</i>‐arc‐strong subdigraphs with few arcs in <i>k</i>‐arc‐strong tournaments

0 references

Adding and Reversing Arcs in Semicomplete Digraphs

0 references

Spanning 2-strong tournaments in 3-strong semicomplete digraphs

0 references

Quasi-hamiltonian paths in semicomplete multipartite digraphs

0 references

A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs

0 references

Finding complementary cycles in locally semicomplete digraphs

0 references

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

0 references

Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs

0 references

Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.

0 references

Exploring the Complexity of Layout Parameters in Tournaments and Semi-Complete Digraphs

0 references

Strong immersion is a well‐quasi‐ordering for semicomplete digraphs

0 references

On the existence of specified cycles in a tournament

0 references

Disjoint cycles of different lengths in graphs and digraphs

0 references

Tournaments and colouring

0 references

Cycles in digraphs– a survey

0 references

Triangle packing in (sparse) tournaments: approximation and kernelization

0 references

Paley graphs satisfy all first-order adjacency axioms

0 references

Powers of Hamilton cycles in tournaments

0 references

Graphs which contain all small graphs

0 references

0 references

Diconnected Orientations and a Conjecture of Las Vergnas

0 references

Short proofs of classical theorems

0 references

0 references

0 references

Landau's and Rado's theorems and partial tournaments

0 references

0 references

0 references

An Approximation Algorithm for Feedback Vertex Sets in Tournaments

0 references

0 references

Trees with three leaves are (\(n+1\))-unavoidable

0 references

The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

0 references

Partitioning vertices of a tournament into independent cycles

0 references

Second neighborhood via first neighborhood in digraphs

0 references

A Min-Max Theorem on Tournaments

0 references

Disjoint paths in tournaments

0 references

A well-quasi-order for tournaments

0 references

Subdivisions of oriented cycles in digraphs with large chromatic number

0 references

The number of Seymour vertices in random tournaments and digraphs

0 references

Kernels for feedback arc set in tournaments

0 references

Cycles of all lengths in arc-3-cyclic semicomplete digraphs

0 references

0 references

On the maximum cardinality of a consistent set of arcs in a random tournament

0 references

Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments

0 references

Paths with two blocks in \(k\)-chromatic digraphs

0 references

Trees in tournaments

0 references

About paths with two blocks

0 references

Graph Theory and Probability

0 references

0 references

Approximating minimum feedback sets and multicuts in directed graphs

0 references

A top-down approach to search-trees: Improved algorithmics for 3-hitting set

0 references

Remarks on the second neighborhood problem

0 references

0 references

Jungles, bundles, and fixed-parameter tractability

0 references

Subexponential Parameterized Algorithm for Computing the Cutwidth of a Semi-complete Digraph

0 references

Parity of paths and circuits in tournaments

0 references

The directed subgraph homeomorphism problem

0 references

Edge-disjoint paths in digraphs with bounded independence number

0 references

Tournament pathwidth and topological containment

0 references

Hamiltonian dicycles avoiding prescribed arcs in tournaments

0 references

Directed vertex-connectivity augmentation

0 references

Minimal edge-coverings of pairs of sets

0 references

On computing the length of longest increasing subsequences

0 references

Quick approximation to matrices and applications

0 references

0 references

A counterexample to a conjecture on edge-coloured tournaments

0 references

0 references

Feedback Vertex Sets in Tournaments

0 references

0 references

0 references

Antidirected Hamiltonian paths in tournaments

0 references

Spanning local tournaments in locally semicomplete digraphs

0 references

Out-arc pancyclicity of vertices in tournaments

0 references

The number of out-pancyclic vertices in a strong tournament

0 references

Hamilton Cycles in Oriented Graphs

0 references

Trees in tournaments

0 references

Zur algebraischen Begründung der Graphentheorie. I

0 references

On unavoidability of trees with \(k\) leaves

0 references

Oriented Hamiltonian cycles in tournaments

0 references

Pancyclic arcs and connectivity in tournaments

0 references

Median orders of tournaments: A tool for the second neighborhood problem and Sumner's conjecture

0 references

Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture

0 references

Hoàng-Reed conjecture holds for tournaments

0 references

A note on short cycles in digraphs

0 references

Long paths and cycles in oriented graphs

0 references

Directed tree-width

0 references

On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs

0 references

0 references

Sparse Spanning $k$-Connected Subgraphs in Tournaments

0 references

Reducibility among Combinatorial Problems

0 references

An exact minimum degree condition for Hamilton cycles in oriented graphs

0 references

Tournament minors

0 references

Bipartitions of highly connected tournaments

0 references

Cycles with two blocks in <i>k</i>‐chromatic digraphs

0 references

0 references

Proof of a conjecture of Thomassen on Hamilton cycles in highly connected tournaments

0 references

A proof of Sumner's universal tournament conjecture for large tournaments

0 references

Hamilton decompositions of regular expanders: A proof of Kelly's conjecture for large tournaments

0 references

Proof of a tournament partition conjecture and an application to 1-factors with prescribed cycle lengths

0 references

0 references

The partition of a strong tournament

0 references

Proof of a Conjecture of Henning and Yeo on Vertex-Disjoint Directed Cycles

0 references

Vertex-disjoint cycles in regular tournaments

0 references

Vertex-disjoint subtournaments of prescribed minimum outdegree or minimum semidegree: proof for tournaments of a conjecture of Stiebitz

0 references

A Step toward the Bermond–Thomassen Conjecture about Disjoint Cycles in Digraphs

0 references

Largest digraphs contained in all n-tournaments

0 references

Circulant tournaments of prime order are tight

0 references

0 references

A Minimax Theorem for Directed Graphs

0 references

0 references

A 7/3-Approximation for Feedback Vertex Sets in Tournaments

0 references

Circular colorings of edge-weighted graphs

0 references

On maximal transitive subtournaments

0 references

On Subtournaments of a Tournament

0 references

0 references

On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs

0 references

The dichromatic number of a digraph

0 references

Vertex critical 4-dichromatic circulant tournaments

0 references

An efficient fixed-parameter algorithm for 3-hitting set

0 references

0 references

Computing cutwidth and pathwidth of semi-complete digraphs via degree orderings

0 references

Edge Disjoint Hamiltonian Cycles in Highly Connected Tournaments

0 references

Highly linked tournaments

0 references

Parameterized algorithms for feedback set problems and their duals in tournaments

0 references

0 references

Finding odd cycle transversals.

0 references

0 references

0 references

Disproof of a conjecture of Erdös and moser on tournaments

0 references

Graph minors. XX: Wagner's conjecture

0 references

Antidirected Hamiltonian circuits in tournaments

0 references

Antidirected Hamiltonian paths in tournaments

0 references

Nombre chromatique et plus longs chemins d'un graphe

0 references

On tournaments free of large transitive subtournaments

0 references

Packing directed circuits fractionally

0 references

On monochromatic paths in m-coloured tournaments

0 references

0 references

Complementary cycles of all lengths in tournaments

0 references

0 references

0 references

Paths and Cycles in Tournaments

0 references

Antidirected Hamilton circuits and paths in tournaments

0 references

0 references

0 references

Disjoint cycles in digraphs

0 references

Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments

0 references

Graph decomposition with constraints on the connectivity and minimum degree

0 references

0 references

Hamiltonian-connected tournaments

0 references

0 references

Strongly 2-connected orientations of graphs

0 references

The 2-linkage problem for acyclic digraphs

0 references

Cycles of each length in tournaments

0 references

A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)

0 references

Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

0 references

0 references

The Hoàng-Reed conjecture for \(\delta ^{+}=3\)

0 references

0 references

Pancyclic out-arcs of a vertex in tournaments

0 references

The number of pancyclic arcs in a <i>k</i>‐strong tournament

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-71840-8_2

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3120434

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q3120434&oldid=36476662"