The classification of complete graphs \(K_n\) on \(f\)-coloring
From MaRDI portal
Publication:2574329
DOI10.1007/BF02935792zbMath1080.05035MaRDI QIDQ2574329
Publication date: 21 November 2005
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
The method of coloring in graphs and its application, 随机图的$f$-染色的分类 II, On \(f\)-colorings of nearly bipartite graphs, \(f\)-class two graphs whose \(f\)-cores have maximum degree two, The classification of \(f\)-coloring of graphs with large maximum degree, \(f\)-colorings of some graphs of \(f\)-class 1, \(H\)-triangles with 3 interior \(H\)-points, Some results on binding number and fractional perfect matching, Some graphs of class 1 for \(f\)-colorings, Graphs of \(f\)-class 1
Cites Work