Fractional \(f\)-edge cover chromatic index of graphs
From MaRDI portal
Publication:2014721
DOI10.1007/s00373-013-1305-0zbMath1301.05128OpenAlexW1981721569MaRDI QIDQ2014721
Guang-Hui Wang, Jin-bo Li, Gui Zhen Liu
Publication date: 16 June 2014
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-013-1305-0
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Edge covering coloring and fractional edge covering coloring
- Edge covering coloring of nearly bipartite graphs
- A note on the edge cover chromatic index of multigraphs
- A generalization of edge-coloring in graphs
- On decompositions of a multi-graph into spanning subgraphs
- Colouring the Edges of a Multigraph so that Each Vertex has at Most j , or at Least j , Edges of Each Colour on it
- SCHEDULING FILE TRANSFERS UNDER PORT AND CHANNEL CONSTRAINTS
This page was built for publication: Fractional \(f\)-edge cover chromatic index of graphs