Efficient algorithms for the edge-cover coloring problem

DOI10.1360/012015-21zbMath1499.05594OpenAlexW2337106077MaRDI QIDQ5063668

Qin Chen

Publication date: 21 March 2022

Published in: SCIENTIA SINICA Mathematica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1360/012015-21

zbMATH Keywords

edge cover coloringnearly bipartite multigraphseries-parallel multigraph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

This page was built for publication: Efficient algorithms for the edge-cover coloring problem