On the Maximum Cut of Line Graphs

DOI10.1017/S096354839800337XzbMATH Open0916.05045OpenAlexW1974901522MaRDI QIDQ4228209FDOQ4228209

Shuji Shiraishi

Publication date: 2 February 1999

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s096354839800337x

zbMATH Keywords

line graphEulerianEuler tour

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Eulerian and Hamiltonian graphs (05C45)

Cited In (1)

• A note on line digraphs and the directed max-cut problem

   Recommendations

• Title not available (Why is that?) 👍 👎
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: On the Maximum Cut of Line Graphs

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