Tournaments without acyclic interval. (Q2573972): 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.1016/j.crma.2005.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105724323 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposability and duality of tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive convex subsets in large tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tournament solutions and majority voting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-time modular decomposition of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex critical r-dichromatic tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures / rank
 
Normal rank

Latest revision as of 12:23, 11 June 2024