The classification of \(f\)-coloring of graphs with large maximum degree
type: Item
instance of: scholarly article
title: The classification of \(f\)-coloring of graphs with large maximum degree
zbMATH Open document ID: 1426.05037
author: Xia Zhang
author: Jiansheng Cai
author: Guiying Yan
published in: Applied Mathematics and Computation
publication date: 2019-04-29T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 7048824
zbMATH Keywords: coloring
zbMATH Keywords: edge coloring
zbMATH Keywords: \(f\)-coloring
zbMATH Keywords: local lemma
MaRDI profile type: Publication
full work available at URL: j.amc.2017.05.059
OpenAlex ID: W2622482471
cites work: The \(f\)-chromatic index of a graph whose \(f\)-core has maximum degree 2
cites work: Q3097395
cites work: A generalization of edge-coloring in graphs
cites work: The NP-Completeness of Edge-Coloring
cites work: Some results about f‐critical graphs
cites work: Graph colouring and the probabilistic method
cites work: Some sufficient conditions for a graph to be of \(C_f\) 1
cites work: \(f\)-class two graphs whose \(f\)-cores have maximum degree two
cites work: The classification of complete graphs \(K_n\) on \(f\)-coloring
DOI: 10.1016/J.AMC.2017.05.059
description: scientific article; zbMATH DE number 7048824