On judicious bipartitions of directed graphs (Q2144584): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.disc.2022.112988 / 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.2022.112988 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4280602867 / rank
 
Normal rank
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: Judicious partitions of 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: 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: Some Extremal Properties of Bipartite Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4090369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound for judicious \(k\)-partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for pairs in judicious partitioning of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bipartitions of directed graphs with small semidegree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound on judicious bipartitions of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartitions of oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bisections of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Judicious partitions of directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning digraphs with outdegree at least 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tight components and anti-tight components / rank
 
Normal rank
Property / cites work
 
Property / cites work: On several partitioning problems of Bollobás and Scott / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for pairs in partitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On judicious bipartitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416246 / 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: Balanced judicious bipartitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better Bounds for <i>k</i>-Partitions of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On judicious bisections of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite density of triangle-free subcubic graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DISC.2022.112988 / rank
 
Normal rank

Latest revision as of 05:47, 17 December 2024

scientific article
Language Label Description Also known as
English
On judicious bipartitions of directed graphs
scientific article

    Statements

    On judicious bipartitions of directed graphs (English)
    0 references
    14 June 2022
    0 references
    directed graph
    0 references
    bipartition
    0 references
    tight component
    0 references
    minimum degree
    0 references
    0 references
    0 references

    Identifiers