Pages that link to "Item:Q5184935"

The following pages link to Regular Graphs of High Degree are 1-Factorizable (Q5184935):

Displaying 36 items.

• On the size of graphs of class 2 whose cores have maximum degree two (Q367049) (← links)
• The chromatic index of graphs with large maximum degree, where the number of vertices of maximum degree is relatively small (Q752723) (← links)
• Approximating the max-edge-coloring problem (Q986540) (← links)
• An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
• A \(\Delta\)-subgraph condition for a graph to be class 1 (Q1087551) (← links)
• The edge-chromatic class of regular graphs of degree 4 and their complements (Q1087882) (← links)
• Critical star multigraphs (Q1089350) (← links)
• Recent progress on edge-colouring graphs (Q1090683) (← links)
• 1-factorizing regular graphs of high degree - an improved bound (Q1121901) (← links)
• Two conjectures on edge-colouring (Q1123197) (← links)
• The spectrum of maximal sets of one-factors (Q1184003) (← links)
• The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
• The chromatic index of graphs of high maximum degree (Q1356656) (← links)
• Edge coloring regular graphs of high degree (Q1356779) (← links)
• Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
• Graph edge coloring: a survey (Q1733850) (← links)
• Total chromatic number of regular graphs of odd order and high degree (Q1918537) (← links)
• The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
• More on the rainbow disconnection in graphs (Q2158198) (← links)
• Edge-colouring of join graphs (Q2369004) (← links)
• Edge-colouring of regular graphs of large degree (Q2465629) (← links)
• \((r,r+1)\)-factorizations of \((d,d+1)\)-graphs (Q2470430) (← links)
• Equitable edge-colorings of simple graphs (Q3083408) (← links)
• The chromatic index of strongly regular graphs (Q3390046) (← links)
• On the Maximum Edge Coloring Problem (Q3602848) (← links)
• One-factorizations of the complete graph—A survey (Q3714114) (← links)
• Graphs which are vertex-critical with respect to the edge-chromatic number (Q3767367) (← links)
• Coloring edges of embedded graphs (Q4521489) (← links)
• Properties, proved and conjectured, of Keller, Mycielski, and queen graphs (Q4604531) (← links)
• Isomorphic factorizations X: Unsolved problems (Q4726287) (← links)
• An Asymptotic Version of the Multigraph 1‐Factorization Conjecture (Q4908822) (← links)
• The number of disjoint perfect matchings in semi-regular graphs (Q5034273) (← links)
• Proof of the 1-factorization and Hamilton Decomposition Conjectures (Q5283773) (← links)
• Optimal path and cycle decompositions of dense quasirandom graphs (Q5890517) (← links)
• Maximally edge‐connected realizations and Kundu's k $k$‐factor theorem (Q6142661) (← links)
• Tight bounds on the chromatic edge stability index of graphs (Q6197718) (← links)