Pages that link to "Item:Q3735724"

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

Displaying 50 items.

• Some class 1 graphs on \(g_c\)-colorings (Q335318) (← links)
• Color-bounded hypergraphs. VI: Structural and functional jumps in complexity (Q383764) (← links)
• Edge-colouring and total-colouring chordless graphs (Q389214) (← links)
• Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
• On a theorem about vertex colorings of graphs (Q579272) (← links)
• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs (Q801935) (← links)
• Some sufficient conditions for a graph to be of \(C_f\) 1 (Q812743) (← links)
• Some generalizations of theorems on vertex coloring (Q855855) (← links)
• Generalised acyclic edge colourings of graphs with large girth (Q879345) (← links)
• \(\mathrm{M}_2\)-edge colorings of cacti and graph joins (Q907831) (← links)
• The chromatic index of multigraphs that are nearly full (Q910411) (← links)
• An adjacency Lemma for critical multigraphs (Q942112) (← 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 colouring by total labellings (Q960914) (← links)
• Some consequences of a theorem on fans (Q971505) (← links)
• Edge covered critical multigraphs (Q998374) (← links)
• A note on the edge cover chromatic index of multigraphs (Q998396) (← links)
• Vertex-, edge-, and total-colorings of Sierpiński-like graphs (Q1024467) (← links)
• Data transfers in networks (Q1097687) (← links)
• Generalized edge theorem (Q1121844) (← 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)
• On Vizing's theorem, adjacency lemma and fan argument generalized to multigraphs (Q1363709) (← links)
• On resolving edge colorings in graphs (Q1415146) (← links)
• Proof of Melnikov-Vizing conjecture for multigraphs with maximum degree at most \(3\) (Q1584243) (← links)
• Some results on an edge coloring problem of Folkman and Fulkerson (Q1587594) (← 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)
• Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation (Q1774528) (← links)
• Graphs of \(f\)-class 1 (Q1786886) (← links)
• A Vizing-type theorem for matching forests (Q1861260) (← links)
• Edge dominating set and colorings on graphs with fixed clique-width (Q1861574) (← links)
• An application of matching theory of edge-colourings (Q1923520) (← links)
• A refinement of Vizing's theorem (Q1978167) (← links)
• Coloring Delaunay-edges and their generalizations (Q1984605) (← links)
• Fractional \(f\)-edge cover chromatic index of graphs (Q2014721) (← links)
• Vizing's and Shannon's theorems for defective edge colouring (Q2094863) (← links)
• Edge coloring of the signed generalized Petersen graph (Q2117562) (← links)
• Vertex colourings of multigraphs with forbiddances on edges (Q2182245) (← links)
• A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
• On the fg-coloring of graphs (Q2277478) (← links)
• A note on the simultaneous edge coloring (Q2305899) (← 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)
• Kőnig's edge-colouring theorem for all graphs (Q2450735) (← links)
• \(f\)-class two graphs whose \(f\)-cores have maximum degree two (Q2452406) (← links)