Extending partial tournaments

DOI10.1016/j.mcm.2008.12.015zbMath1185.05072OpenAlexW1985042110MaRDI QIDQ969878

K. Brooks Reid, David E. Brown, Leroy B. Beasley

Publication date: 8 May 2010

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.mcm.2008.12.015

zbMATH Keywords

tournament matrixmatrix completionstournament digraph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

On partial sorting in restricted rounds ⋮ Preserving regular tournaments and term rank-1

Cites Work

• Landau's and Rado's theorems and partial tournaments
• Matrix completions and chordal graphs
• Graph theoretic methods for matrix completion problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Extending partial tournaments