A note on the \((g, f)\)-coloring

DOI10.1007/S12190-008-0094-8zbMath1193.05135OpenAlexW2057008055MaRDI QIDQ949352

Changqing Xu, 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-008-0094-8

Mathematics Subject Classification ID

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

Related Items (1)

The method of coloring in graphs and its application

Cites Work

• A linear algorithm for finding \([g,f\)-colorings of partial \(k\)-trees]
• A generalization of edge-coloring in graphs
• On the f-coloring of multigraphs
• Edge-Coloring Problems for Graphs.
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A note on the \((g, f)\)-coloring