Pages that link to "Item:Q3735724"

The following pages link to A generalization of edge-coloring in graphs (Q3735724):

Displaying 40 items.

• Some class 1 graphs on \(g_c\)-colorings (Q335318) (← links)
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
• Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins (Q907831) (← links)
• The chromatic index of multigraphs that are nearly full (Q910411) (← links)
• \(f\)-colorings of some graphs of \(f\)-class 1 (Q943513) (← links)
• A special \(f\)-edge cover-coloring of multigraphs (Q949274) (← links)
• A note on the \((g, f)\)-coloring (Q949352) (← links)
• Edge covered critical multigraphs (Q998374) (← links)
• A note on the edge cover chromatic index of multigraphs (Q998396) (← links)
• Data transfers in networks (Q1097687) (← links)
• Decompositions to degree-constrained subgraphs are simply reducible to edge-colorings (Q1305535) (← links)
• A generalization of chromatic index (Q1313837) (← links)
• A sufficient condition for equitable edge-colourings of simple graphs (Q1322183) (← links)
• Spectrum graph coloring and applications to Wi-Fi channel assignment (Q1657008) (← links)
• On \(f\)-colorings of nearly bipartite graphs (Q1707984) (← links)
• The classification of \(f\)-coloring of graphs with large maximum degree (Q1740035) (← links)
• Graphs of \(f\)-class 1 (Q1786886) (← links)
• Fractional \(f\)-edge cover chromatic index of graphs (Q2014721) (← links)
• On the fg-coloring of graphs (Q2277478) (← links)
• On the minimum number of bond-edge types and tile types: an approach by edge-colorings of graphs (Q2306579) (← links)
• The method of coloring in graphs and its application (Q2429917) (← links)
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two (Q2452406) (← links)
• Some properties on \(f\)-edge covered critical graphs (Q2454989) (← links)
• Some graphs of class 1 for \(f\)-colorings (Q2472816) (← links)
• The classification of complete graphs \(K_n\) on \(f\)-coloring (Q2574329) (← links)
• On the fractional<i>f</i>-chromatic index of a graph (Q3066980) (← links)
• Equitable edge-colorings of simple graphs (Q3083408) (← links)
• A note on M2-edge colorings of graphs (Q3458960) (← links)
• Improved bounds for the chromatic index of graphs and multigraphs (Q4719322) (← links)
• 随机图的$f$-染色的分类 II (Q5037963) (← links)
• A parallel algorithm for edge-coloring partial k-trees (Q5054775) (← links)
• ON SUPER f-EDGE COVER-COLORING IN MULTIGRAPHS (Q5189991) (← links)
• (Q5206907) (← links)
• On the<i>f</i>-matching polytope and the fractional<i>f</i>-chromatic index (Q5248091) (← links)
• Polychromatic colorings of plane graphs (Q5896961) (← links)
• Simple reduction of f-colorings to edge-colorings (Q6085710) (← links)
• Orientation‐based edge‐colorings and linear arboricity of multigraphs (Q6094040) (← links)
• On an \(f\)-coloring generalization of linear arboricity of multigraphs (Q6184546) (← links)
• Algorithms for finding f-colorings of partial k-trees (Q6487980) (← links)