Bipartite density of triangle-free subcubic graphs

DOI10.1016/j.dam.2008.07.007zbMath1177.05059OpenAlexW2085815746MaRDI QIDQ1028464

Xuding Zhu

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.07.007

zbMATH Keywords

triangle-freesubcubic graphmax-cutbipartite density

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75)

Related Items (12)

On judicious partitions of uniform hypergraphs ⋮ On judicious bipartitions of directed graphs ⋮ Bounds for pairs in judicious partitioning of graphs ⋮ Partitioning digraphs with outdegree at least 4 ⋮ Independence densities of hypergraphs ⋮ Graph partitioning: an updated survey ⋮ Bisections of Graphs Without Short Cycles ⋮ Judicious Partitioning of Hypergraphs with Edges of Size at Most 2 ⋮ A bound for judicious \(k\)-partitions of graphs ⋮ A bound on judicious bipartitions of directed graphs ⋮ On a Problem of Judiciousk-Partitions of Graphs ⋮ On bisections of directed graphs

Cites Work

• Triangle-free subcubic graphs with minimum bipartite density
• Largest bipartite subgraphs in triangle-free graphs with maximum degree three
• Maximumk-colorable subgraphs
• Extremal bipartite subgraphs of cubic triangle-free graphs
• Problems and results on judicious partitions
• Node-and edge-deletion NP-complete problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Bipartite density of triangle-free subcubic graphs