A generalization of edge-coloring in graphs
From MaRDI portal
Publication:3735724
DOI10.1002/jgt.3190100202zbMath0601.05021OpenAlexW2045611333MaRDI QIDQ3735724
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100202
Related Items (39)
A parallel algorithm for edge-coloring partial k-trees ⋮ Data transfers in networks ⋮ Unnamed Item ⋮ A note on M2-edge colorings of graphs ⋮ Some class 1 graphs on \(g_c\)-colorings ⋮ Spectrum graph coloring and applications to Wi-Fi channel assignment ⋮ Color-bounded hypergraphs. VI: Structural and functional jumps in complexity ⋮ Simple reduction of f-colorings to edge-colorings ⋮ Orientation‐based edge‐colorings and linear arboricity of multigraphs ⋮ On an \(f\)-coloring generalization of linear arboricity of multigraphs ⋮ The method of coloring in graphs and its application ⋮ 随机图的$f$-染色的分类 II ⋮ \(\mathrm{M}_2\)-edge colorings of cacti and graph joins ⋮ The chromatic index of multigraphs that are nearly full ⋮ On \(f\)-colorings of nearly bipartite graphs ⋮ Improved bounds for the chromatic index of graphs and multigraphs ⋮ \(f\)-class two graphs whose \(f\)-cores have maximum degree two ⋮ Some properties on \(f\)-edge covered critical graphs ⋮ The classification of \(f\)-coloring of graphs with large maximum degree ⋮ Polychromatic colorings of plane graphs ⋮ \(f\)-colorings of some graphs of \(f\)-class 1 ⋮ A special \(f\)-edge cover-coloring of multigraphs ⋮ A note on the \((g, f)\)-coloring ⋮ Some graphs of class 1 for \(f\)-colorings ⋮ Fractional \(f\)-edge cover chromatic index of graphs ⋮ ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS ⋮ On the fg-coloring of graphs ⋮ Graphs of \(f\)-class 1 ⋮ Edge covered critical multigraphs ⋮ A note on the edge cover chromatic index of multigraphs ⋮ On the fractionalf-chromatic index of a graph ⋮ Equitable edge-colorings of simple graphs ⋮ On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs ⋮ On thef-matching polytope and the fractionalf-chromatic index ⋮ The classification of complete graphs \(K_n\) on \(f\)-coloring ⋮ Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings ⋮ A generalization of chromatic index ⋮ Some sufficient conditions for a graph to be of \(C_f\) 1 ⋮ A sufficient condition for equitable edge-colourings of simple graphs
Cites Work
This page was built for publication: A generalization of edge-coloring in graphs
