One way cuts in oriented graphs

2007/12/28 by Simon Griffiths, Griffiths, Simon
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #math.CO

paper · pdf · doi:10.48550/arxiv.0712.4305

This paper has been withdrawn by the author. now included in "Subgraphs of weakly quasi-random oriented graphs"

openalex publication_date 2007/12/28 · arxiv created 2010/11/19 · arxiv updated 2010/11/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

This paper has been withdrawn by the author.

Related

• Optical theorem and cutting rules
• Really Straight Graph Drawings
• Cut locus structures on graphs
• A Short Note on Relevant Cuts
• Augmenting Edge Connectivity via Isolating Cuts