Maximum directed cuts in digraphs with degree restriction (Q3633002): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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: On incidence coloring and star arboricity of graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: MAX CUT in cubic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Triangle-free partial graphs and edge covering theorems / 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: Node-and edge-deletion NP-complete problems / rank | |||
Normal rank | |||
Latest revision as of 15:43, 1 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Maximum directed cuts in digraphs with degree restriction |
scientific article |
Statements
Maximum directed cuts in digraphs with degree restriction (English)
0 references
16 June 2009
0 references
directed cut
0 references
maximum cut
0 references
directed cut and acyclic graphs
0 references
extremal problems
0 references
