Intersection properties of maximal directed cuts in digraphs

DOI10.1016/J.DISC.2016.07.003zbMATH Open1347.05083OpenAlexW2480827673MaRDI QIDQ329544FDOQ329544

Authors: G. Chiaselotti, T. Gentile 

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

Recommendations

• Maximum directed cuts in acyclic digraphs
• On maximum edge cuts of connected digraphs
• Covering the edges of digraphs in \(\mathcal D(3,3)\) and \(\mathcal D(4,4)\) with directed cuts
• A family of perfect graphs associated with directed graphs
• scientific article; zbMATH DE number 2197947

zbMATH Keywords

digraphscyclesdirected cutsmaximal paths

Mathematics Subject Classification ID

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

Cites Work

• A Minimax Theorem for Directed Graphs
• On two minimax theorems in graph
• Directed cut transversal packing for source-sink connected graphs
• 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
• 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
• Excluding a simple good pair approach to directed cuts

Cited In (11)

• Indiscernibility structures induced from function sets: graph and digraph case
• Decision systems in rough set theory: a set operatorial perspective
• A note on line digraphs and the directed max-cut problem
• Some classifications of graphs with respect to a set adjacency relation
• Maximum directed cuts in acyclic digraphs
• Title not available (Why is that?)
• Simplicial complexes and closure systems induced by indistinguishability relations
• Disjoint dijoins for classes of dicuts in finite and infinite digraphs
• A family of perfect graphs associated with directed graphs
• Directed Intersection Representations and the Information Content of Digraphs
• Rough sets on graphs: new dependency and accuracy measures

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

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