Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
type: Item
instance of: scholarly article
title: Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs
zbMATH Open document ID: 1207.05067
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 5648102
zbMATH Keywords: generalizations of tournaments
zbMATH Keywords: paths
Wikidata QID: Q123241392
author: Jørgen Bang-Jensen
MaRDI profile type: Publication
full work available at URL: j.disc.2008.04.016
OpenAlex ID: W2017541517
cites work: Hardness of fully dense problems
cites work: Aggregating inconsistent information
cites work: Ranking Tournaments
cites work: Edge-disjoint in- and out-branchings in tournaments and related path problems
cites work: Digraphs with the path‐merging property
cites work: Generalizations of tournaments: A survey
cites work: Q4500916
cites work: Weakly Hamiltonian-connected ordinary multipartite tournaments
cites work: Hamiltonian Cycles Avoiding Prescribed Arcs in Tournaments
cites work: A polynomial algorithm for the Hamiltonian cycle problem in semicomplete multipartite digraphs
cites work: Strongly Connected Spanning Subdigraphs with the Minimum Number of Arcs in Quasi-transitive Digraphs
cites work: Spanning k‐arc‐strong subdigraphs with few arcs in k‐arc‐strong tournaments
cites work: Adding and Reversing Arcs in Semicomplete Digraphs
cites work: A polynomial algorithm for hamiltonian-connectedness in semicomplete digraphs
cites work: Minimum cycle factors in quasi-transitive digraphs
cites work: A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs
cites work: The minimum spanning strong subdigraph problem for extended semicomplete digraphs and semicomplete bipartite digraphs
cites work: Decomposing \(k\)-arc-strong tournaments into strong spanning subdigraphs
cites work: Making a tournament \(k\)-arc-strong by reversing or deorienting arcs.
cites work: Powers of Hamilton cycles in tournaments
cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments
cites work: Partitioning vertices of a tournament into independent cycles
cites work: Approximating Minimum-Size k-Connected Spanning Subgraphs via Matching
cites work: Q4143334
cites work: Optimum branchings
cites work: Trees in tournaments
cites work: Hamiltonian dicycles avoiding prescribed arcs in tournaments
cites work: An Algorithm for Submodular Functions on Graphs
cites work: Q4871749
cites work: Minimal edge-coverings of pairs of sets
cites work: Approximation Algorithms for Several Graph Augmentation Problems
cites work: LOCALLY SEMICOMPLETE DIGRAPHS WITH A FACTOR COMPOSED OF k CYCLES
cites work: Spanning local tournaments in locally semicomplete digraphs
cites work: On complementary cycles in locally semicomplete digraphs
cites work: Finding an Oriented Hamiltonian Path in a Tournament
cites work: Oriented Hamiltonian paths in tournaments: A proof of Rosenfeld's conjecture
cites work: Antidirected Hamiltonian paths between specified vertices of a tournament
cites work: A note on spanning local tournaments in locally semicomplete digraphs
cites work: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs
cites work: Approximating the Minimum Equivalent Digraph
cites work: Q5585195
cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs
cites work: Algorithms and Data Structures
cites work: Q3691764
cites work: Complementary cycles of all lengths in tournaments
cites work: Hamiltonian-connected tournaments
cites work: Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments
cites work: Q3491608
cites work: Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs
cites work: Approximating the minimum strongly connected subgraph via a matching lower bound
cites work: Cycles in multipartite tournaments: Results and problems
cites work: Q3671196
cites work: A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
DOI: 10.1016/J.DISC.2008.04.016
description: scientific article; zbMATH DE number 5648102