A special \(f\)-edge cover-coloring of multigraphs

DOI10.1007/s12190-007-0027-yzbMath1155.05028OpenAlexW2048510168MaRDI QIDQ949274

Yongxun Xin, Gui Zhen Liu

Publication date: 21 October 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-007-0027-y

zbMATH Keywords

multigraph\(f\)-edge cover-coloringedge-cover coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Edge covering coloring and fractional edge covering coloring
• A sufficient condition for equitable edge-colourings of simple graphs
• Chromatic sums of nonseparable simple maps on the plane.
• Chromatic sums of singular maps on some surfaces.
• Newton's method, zeroes of vector fields, and the Riemannian center of mass
• A generalization of edge-coloring in graphs
• On decompositions of a multi-graph into spanning subgraphs
• Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
• Edge-Coloring Problems for Graphs.