Maximum cuts in edge-colored graphs

DOI10.1016/J.DAM.2019.02.038MaRDI QIDQ6830413zbMATH OpenFDO

Authors Luerbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza, Rubens A. Sucupira

Publication date 29 May 2020

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

Full work available at URL https://doi.org/10.1016/J.DAM.2019.02.038

zbMATH Keywords

colored cutedge cutmaximum cutparameterized complexityplanar graphpolynomial kernel

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cited in

(2)

• Maximum colored cuts in edge-colored graphs without short properly cycles
• Some lower bounds for maximum colored cuts

This page was built for publication: Maximum cuts in edge-colored graphs

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