Acyclically pushable bipartite permutation digraphs: an algorithm

DOI10.1016/j.disc.2005.11.027zbMath1098.05038OpenAlexW1975934581MaRDI QIDQ2497498

Romeo Rizzi

Publication date: 4 August 2006

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

Full work available at URL: https://doi.org/10.1016/j.disc.2005.11.027

zbMATH Keywords

tournamentsorientationlinear-time algorithmspushstrongly acyclic digraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Balanced cycles and holes in bipartite graphs
• Pushing vertices in digraphs without long induced cycles
• Hamiltonicity and reversing arcs in digraphs
• Dividing a Graph into Triconnected Components
• A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
• Pushing the cycles out of multipartite tournaments

This page was built for publication: Acyclically pushable bipartite permutation digraphs: an algorithm