Maximum directed cuts in graphs with degree constraints (Q1926032): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bipartite subgraphs / rank
 
Normal 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: Hall ratio of the Mycielski graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relations among the fractional chromatic, choice, Hall, and Hall-condition numbers of simple graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation of Max-Cut on graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: MAX CUT in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal bipartite subgraphs of cubic triangle-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4305534 / 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: Q3898517 / 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 01:08, 6 July 2024

scientific article
Language Label Description Also known as
English
Maximum directed cuts in graphs with degree constraints
scientific article

    Statements

    Maximum directed cuts in graphs with degree constraints (English)
    0 references
    0 references
    0 references
    27 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    maximum directed cut
    0 references
    max cut problem
    0 references
    NP-hard problem
    0 references
    Hall ratio
    0 references
    acyclic digraph
    0 references
    digraphs containing no directed triangles
    0 references
    maximum dicut
    0 references
    directed cut
    0 references
    subcubic graph
    0 references
    triangle-free graph
    0 references
    0 references