On Maximum Edge Cuts of Connected Digraphs (Q5418765): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/jgt.21746 / rank | |||
| Property / cites work | |||
| Property / cites work: Maximum directed cuts in acyclic digraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Largest bipartite subgraphs in triangle-free graphs with maximum degree three / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum directed cuts in digraphs with degree restriction / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Optimization, approximation, and complexity classes / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangle-free subcubic graphs with minimum bipartite density / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximum directed cuts in graphs with degree constraints / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/JGT.21746 / rank | |||
Normal rank | |||
Latest revision as of 16:57, 30 December 2024
scientific article; zbMATH DE number 6298844
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On Maximum Edge Cuts of Connected Digraphs |
scientific article; zbMATH DE number 6298844 |
Statements
On Maximum Edge Cuts of Connected Digraphs (English)
0 references
28 May 2014
0 references
maximum edge cuts
0 references
digraph
0 references
