Every vertex a king

DOI10.1016/0012-365X(82)90173-XzbMath0482.05040MaRDI QIDQ1162521

K. Brooks Reid

Publication date: 1982

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

tournamentserf

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20)

Related Items (22)

Unnamed Item ⋮ The number of kings in a multipartite tournament ⋮ Kings in bipartite tournaments ⋮ Kings in multipartite tournaments ⋮ The diameter of an orientation of a complete multipartite graph ⋮ Number of 4-kings in bipartite tournaments with no 3-kings ⋮ Optimal orientations of products of paths and cycles ⋮ On semicomplete multipartite digraphs whose king sets are semicomplete digraphs ⋮ The existence and uniqueness of strong kings in tournaments ⋮ On the 3-kings and 4-kings in multipartite tournaments ⋮ On optimal orientations of Cartesian products with a bipartite graph ⋮ Kings in locally semicomplete digraphs ⋮ The orientation number of two complete graphs with linkages ⋮ Toppling kings in multipartite tournaments by introducing new kings ⋮ On the kings and kings-of-kings in semicomplete multipartite digraphs ⋮ Robust bounds on choosing from large tournaments ⋮ On a conjecture concerning the orientation number of a graph ⋮ The minimum diameter of orientations of complete multipartite graphs ⋮ Kings in quasi-transitive digraphs ⋮ On optimal orientations of Cartesian products of graphs. I ⋮ Digraphs with unique minimal king sets ⋮ Robust bounds on choosing from large tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Every vertex a king