A note on the (g, f)-coloring

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

Authors 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

Mathematics Subject Classification ID

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

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

Cites work

• scientific article; zbMATH DE number 700639 (Why is no real title available?)
• scientific article; zbMATH DE number 3378938 (Why is no real title available?)
• A generalization of edge-coloring in graphs
• A linear algorithm for finding \([g,f]\)-colorings of partial \(k\)-trees
• Edge-Coloring Problems for Graphs.
• On \(f\)-edge cover-coloring in multigraphs
• On the f-coloring of multigraphs
• SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS

Cited in

(4)

• A note on edge coloring of graphs.
• A note on the \((g,f)\)-chromatic index of graphs
• 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)