On the fractional f-chromatic index of a graph
From MaRDI portal
Publication:3066980
DOI10.1080/00207160903349572zbMATH Open1214.05034OpenAlexW1970329970MaRDI QIDQ3066980FDOQ3066980
Authors: Xia Zhang, Jiguo Yu, Guizhen 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
Recommendations
Cites Work
- Graph theory with applications
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- Scheduling File Transfers
- A generalization of edge-coloring in graphs
- Some results about f‐critical graphs
- \(f\)-colorings of some graphs of \(f\)-class 1
- On the f-coloring of multigraphs
- Some sufficient conditions for a graph to be of \(C_f\) 1
- Some graphs of class 1 for \(f\)-colorings
- Scheduling File Transfers for Trees and Odd Cycles
Cited In (6)
- Fractional \(f\)-edge cover chromatic index of graphs
- Some results on fractional edge coloring of graphs.
- On the fractional chromatic number of monotone self-dual Boolean functions
- On thef-matching polytope and the fractionalf-chromatic index
- On the fractional chromatic number and the lexicographic product of graphs
- Fractional strong chromatic index of bipartite graphs
This page was built for publication: On the fractional \(f\)-chromatic index of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3066980)