Some graphs of class 1 for \(f\)-colorings
From MaRDI portal
Publication:2472816
DOI10.1016/j.aml.2007.02.009zbMath1132.05026OpenAlexW2075727520MaRDI QIDQ2472816
Publication date: 25 February 2008
Published in: Applied Mathematics Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aml.2007.02.009
Related Items
Unnamed Item ⋮ A note on M2-edge colorings of graphs ⋮ The method of coloring in graphs and its application ⋮ \(\mathrm{M}_2\)-edge colorings of cacti and graph joins ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ Graphs of \(f\)-class 1 ⋮ On the fractionalf-chromatic index of a graph ⋮ Equitable edge-colorings of simple graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Some sufficient conditions for a graph to be of \(C_f\) 1
- Class one graphs
- The classification of complete graphs \(K_n\) on \(f\)-coloring
- A generalization of edge-coloring in graphs
- Scheduling File Transfers
- Scheduling File Transfers for Trees and Odd Cycles
- On the f-coloring of multigraphs
- The NP-Completeness of Edge-Coloring
- Improved bounds for the chromatic index of graphs and multigraphs