On the fractionalf-chromatic index of a graph
From MaRDI portal
Publication:3066980
DOI10.1080/00207160903349572zbMath1214.05034OpenAlexW1970329970MaRDI QIDQ3066980
Jiguo Yu, Xia Zhang, Gui Zhen Liu
Publication date: 20 January 2011
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160903349572
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Some sufficient conditions for a graph to be of \(C_f\) 1
- \(f\)-colorings of some graphs of \(f\)-class 1
- Some graphs of class 1 for \(f\)-colorings
- 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
- Some results about f‐critical graphs
This page was built for publication: On the fractionalf-chromatic index of a graph