Some results about f‐critical graphs
Work
Year: 2007
Type: article
Abstract: An f ‐coloring of a multigraph G is a coloring of the edges of E such that each color appears at each vertex v ∈ V at most f ( v ) times. The minimum number of colors needed to f ‐color G is called t... more
Source: Networks
Authors Guizhen Liu, Jianfeng Hou, Jiansheng Cai
Institution Shandong University
Cites: 10
Cited by: 7
Related to: 10
FWCI: 0.606
Citation percentile (by year/subfield): 65.14
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze