Bisections of Graphs Without Short Cycles (Q4601051): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Geng-Hua Fan / rank
Normal rank
 
Property / author
 
Property / author: Jian-Feng Hou / rank
Normal rank
 
Property / author
 
Property / author: Geng-Hua Fan / rank
 
Normal rank
Property / author
 
Property / author: Jian-Feng Hou / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite subgraphs / 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: 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: Cycles of even length in 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: Q4090369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The size of the largest bipartite subgraphs / 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: Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisections of graphs / 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: On judicious bipartitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite Subgraphs of Triangle-Free Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3416246 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced judicious bipartitions of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on balanced bipartitions / 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: Judicious \(k\)-partitions 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1017/s0963548317000487 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2758344425 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:39, 30 July 2024

scientific article; zbMATH DE number 6827481
Language Label Description Also known as
English
Bisections of Graphs Without Short Cycles
scientific article; zbMATH DE number 6827481

    Statements

    Bisections of Graphs Without Short Cycles (English)
    0 references
    0 references
    0 references
    0 references
    19 January 2018
    0 references
    bipartite cut problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references