A note on the (g, f)-coloring

DOI10.1007/S12190-008-0094-8zbMATH Open1193.05135OpenAlexW2057008055MaRDI QIDQ949352FDOQ949352

Changqing Xu, Guizhen 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

Recommendations

• A note on the \((g,f)\)-chromatic index of graphs
• A polynomial algorithm for finding \((g,f)\)-colorings orthogonal to stars in bipartite graphs
• On \(f\)-colorings of nearly bipartite graphs
• scientific article; zbMATH DE number 1555935
• Edge-Coloring and f-Coloring for Various Classes of Graphs

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• A note on Dehn colorings and invariant factors
• The method of coloring in graphs and its application

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

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