The following pages link to (Q3118960):
Displaying 50 items.
- On a limit of the method of Tashkinov trees for edge-colouring (Q297916) (← links)
- Face-degree bounds for planar critical graphs (Q311518) (← links)
- The complexity of counting edge colorings and a dichotomy for some higher domain Holant problems (Q313398) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- A game generalizing Hall's theorem (Q394371) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Achieving maximum chromatic index in multigraphs (Q1025461) (← links)
- Extension from precoloured sets of edges (Q1658745) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- Average degrees of edge-chromatic critical graphs (Q1999729) (← links)
- Measurable versions of Vizing's theorem (Q2006081) (← links)
- On the coequal values of total chromatic number and chromatic index (Q2101175) (← links)
- An improvement to the Hilton-Zhao vertex-splitting conjecture (Q2142639) (← links)
- Zero-divisor graphs and total coloring conjecture (Q2156940) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Hamiltonicity of edge-chromatic critical graphs (Q2182200) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- On the average degree of edge chromatic critical graphs. II. (Q2200934) (← links)
- On the average degree of edge chromatic critical graphs (Q2222052) (← links)
- Upper bounds on the maximum degree of class two graphs on surfaces (Q2286600) (← links)
- Some remarks on interval colorings of complete tripartite and biregular graphs (Q2306598) (← links)
- Goldberg's conjecture is true for random multigraphs (Q2312622) (← links)
- Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
- Integer round-up property for the chromatic number of some \(h\)-perfect graphs (Q2364493) (← links)
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs (Q2401803) (← links)
- Finding \(\Delta (\Sigma)\) for a surface \(\Sigma \) of characteristic \(-6\) and \(-7\) (Q2409528) (← links)
- A new tool for proving Vizing's theorem (Q2449145) (← links)
- Edge coloring multigraphs without small dense subsets (Q2515595) (← links)
- One-sided interval edge-colorings of bipartite graphs (Q2629271) (← links)
- Reflexive coloring complexes for 3-edge-colorings of cubic graphs (Q2659215) (← links)
- A fast distributed algorithm for \((\Delta+1)\)-edge-coloring (Q2664558) (← links)
- A note on one-sided interval edge colorings of bipartite graphs (Q2666587) (← links)
- Overfullness of critical class 2 graphs with a small core degree (Q2673482) (← links)
- Optimal Online Edge Coloring of Planar Graphs with Advice (Q2947032) (← links)
- On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees (Q2947944) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- On characterizing Vizing's edge colouring bound (Q3113286) (← links)
- On a theorem of Goldberg (Q3174233) (← links)
- Solution of Vizing's Problem on Interchanges for the case of Graphs with Maximum Degree 4 and Related Results (Q3188669) (← links)
- Properties, proved and conjectured, of Keller, Mycielski, and queen graphs (Q4604531) (← links)
- Densities, Matchings, and Fractional Edge-Colorings (Q4620419) (← links)
- INDUCED \(nK_{2}\) DECOMPOSITION OF INFINITE SQUARE GRIDS AND INFINITE HEXAGONAL GRIDS (Q5042209) (← links)
- The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (Q5232150) (← links)
- On the<i>f</i>-matching polytope and the fractional<i>f</i>-chromatic index (Q5248091) (← links)
- Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
- A Combined Logarithmic Bound on the Chromatic Index of Multigraphs (Q5325936) (← links)
