Intersection properties of maximal directed cuts in digraphs

DOI10.1016/j.disc.2016.07.003zbMath1347.05083OpenAlexW2480827673MaRDI QIDQ329544

Tommaso Gentile, Giampiero Chiaselotti

Publication date: 21 October 2016

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

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

zbMATH Keywords

cyclesdigraphsdirected cutsmaximal paths

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Indiscernibility structures induced from function sets : Graph and digraph case ⋮ Rough sets on graphs: New dependency and accuracy measures ⋮ Simplicial complexes and closure systems induced by indistinguishability relations ⋮ Decision systems in rough set theory: A set operatorial perspective ⋮ Some classifications of graphs with respect to a set adjacency relation

Cites Work

• Covering digraphs with small indegrees or outdegrees by directed cuts
• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• Online maximum directed cut
• Directed cut transversal packing for source-sink connected graphs
• On two minimax theorems in graph
• Maximum directed cuts in graphs with degree constraints
• Maximum directed cuts in acyclic digraphs
• Cut-primitive directed graphs versus clan-primitive directed graphs
• Maximum directed cuts in digraphs with degree restriction
• Online Maximum Directed Cut
• A Minimax Theorem for Directed Graphs
• Excluding a simple good pair approach to directed cuts

This page was built for publication: Intersection properties of maximal directed cuts in digraphs