On the Maximum Cut of Line Graphs

DOI10.1017/S096354839800337XMaRDI QIDQ4228209zbMATH OpenOpenAlexFDO

Authors 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

Euler tourEulerianline graph

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 780784
• Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality
• scientific article; zbMATH DE number 4193718

Cited in

(1)

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

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)