On max cut in cubic graphs

DOI10.1080/10637190127724zbMATH Open1024.68074OpenAlexW2006370918MaRDI QIDQ4409003FDOQ4409003

Authors: Irene Finocchi, Rossella Petreschi, Tiziana Calamoneri, Y. Manoussakis 

Publication date: 29 June 2003

Full work available at URL: https://doi.org/10.1080/10637190127724

Recommendations

• scientific article; zbMATH DE number 1500552
• MAX CUT in cubic graphs
• scientific article; zbMATH DE number 176747
• scientific article; zbMATH DE number 1787231
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

zbMATH Keywords

cubic graphsbipartite graphsmaximum cut problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cited In (7)

• Use of MAX-CUT for Ramsey Arrowing of Triangles
• Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
• Title not available (Why is that?)
• A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs
• MAX CUT in cubic graphs
• Max-cut in circulant graphs
• Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3

This page was built for publication: On max cut in cubic graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4409003)