Pages that link to "Item:Q329544"
From MaRDI portal
The following pages link to Intersection properties of maximal directed cuts in digraphs (Q329544):
Displaying 10 items.
- A family of perfect graphs associated with directed graphs (Q796547) (← links)
- A note on line digraphs and the directed max-cut problem (Q1174433) (← links)
- Simplicial complexes and closure systems induced by indistinguishability relations (Q2408539) (← links)
- Maximum directed cuts in acyclic digraphs (Q3445498) (← links)
- Rough sets on graphs: New dependency and accuracy measures (Q4554547) (← links)
- Indiscernibility structures induced from function sets : Graph and digraph case (Q5031926) (← links)
- Disjoint dijoins for classes of dicuts in finite and infinite digraphs (Q5051459) (← links)
- Directed Intersection Representations and the Information Content of Digraphs (Q5151714) (← links)
- Decision systems in rough set theory: A set operatorial perspective (Q5376483) (← links)
- Some classifications of graphs with respect to a set adjacency relation (Q5859499) (← links)