Nearly-acyclically pushable tournaments

MaRDI QIDQ2712519zbMATH OpenFDO

Authors Kathryn L. B. Wood, Jing Huang

Publication date 6 May 2001

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

tournamentacyclic tournamentpushing

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Structural characterization of families of graphs (05C75)

Recommendations

• Pushing the cycles out of multipartite tournaments
• Re-orienting tournaments by pushing vertices.
• Pushing vertices in digraphs without long induced cycles
• Acyclically pushable bipartite permutation digraphs: an algorithm
• An extremal connectivity parameter of tournaments

Cited in

(6)

• On high-dimensional acyclic tournaments
• No additional tournaments are quasirandom-forcing
• Pushing vertices in digraphs without long induced cycles
• Decomposability index of tournaments
• Re-orienting tournaments by pushing vertices.
• Pushing the cycles out of multipartite tournaments

This page was built for publication: Nearly-acyclically pushable tournaments

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2712519)