Approximating Maximum Edge 2-Coloring by Normalizing Graphs

In a simple, undirected graph G, an edge 2-coloring is a coloring of the edges such that no vertex is incident to edges with more than 2 distinct colors. The problem maximum edge 2-coloring (ME2C) is to find an edge 2-coloring in a graph G with the goal to maximize the number of colors. For a releva...

Full description

Bibliographic Details

Published in:	Discrete mathematics and theoretical computer science Vol. 27:2; no. Discrete Algorithms
Main Authors:	Mömke, Tobias, Popa, Alexandru, Roshany-Tabrizi, Aida, Ruderer, Michael, Vincze, Roland
Format:	Journal Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 01.05.2025
Subjects:	computer science - data structures and algorithms computer science - discrete mathematics
ISSN:	1365-8050, 1365-8050
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!