Max \(k\)-cut and judicious \(k\)-partitions (Q982619): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q222637
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Alexander D. Scott / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2010.04.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022851630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum cuts and judicious partitions in graphs without short cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs of integer weighted graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems and results on judicious partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4550236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of 3-uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact bounds for judicious partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4552255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4304346 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a bottleneck bipartition conjecture of Erdős / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416246 / rank
 
Normal rank

Latest revision as of 23:39, 2 July 2024

scientific article
Language Label Description Also known as
English
Max \(k\)-cut and judicious \(k\)-partitions
scientific article

    Statements

    Max \(k\)-cut and judicious \(k\)-partitions (English)
    0 references
    0 references
    0 references
    7 July 2010
    0 references
    max cut
    0 references
    judicious partitions
    0 references
    extremal graph theory
    0 references

    Identifiers