A generalization of edge-coloring in graphs
From MaRDI portal
Publication:3735724
DOI10.1002/jgt.3190100202zbMath0601.05021MaRDI 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
05C15: Coloring of graphs and hypergraphs
Related Items
Unnamed Item, ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS, On thef-matching polytope and the fractionalf-chromatic index, Polychromatic colorings of plane graphs, Some class 1 graphs on \(g_c\)-colorings, Color-bounded hypergraphs. VI: Structural and functional jumps in complexity, Some sufficient conditions for a graph to be of \(C_f\) 1, \(\mathrm{M}_2\)-edge colorings of cacti and graph joins, The chromatic index of multigraphs that are nearly full, \(f\)-colorings of some graphs of \(f\)-class 1, A special \(f\)-edge cover-coloring of multigraphs, A note on the \((g, f)\)-coloring, Edge covered critical multigraphs, A note on the edge cover chromatic index of multigraphs, Data transfers in networks, Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings, A generalization of chromatic index, A sufficient condition for equitable edge-colourings of simple graphs, Spectrum graph coloring and applications to Wi-Fi channel assignment, On \(f\)-colorings of nearly bipartite graphs, The classification of \(f\)-coloring of graphs with large maximum degree, Graphs of \(f\)-class 1, Fractional \(f\)-edge cover chromatic index of graphs, On the fg-coloring of graphs, The method of coloring in graphs and its application, \(f\)-class two graphs whose \(f\)-cores have maximum degree two, Some properties on \(f\)-edge covered critical graphs, Some graphs of class 1 for \(f\)-colorings, The classification of complete graphs \(K_n\) on \(f\)-coloring, On the fractionalf-chromatic index of a graph, Equitable edge-colorings of simple graphs, A note on M2-edge colorings of graphs
Cites Work
