Pages that link to "Item:Q6094039"
From MaRDI portal
The following pages link to Edge coloring graphs with large minimum degree (Q6094039):
Displaying 15 items.
- Recent progress on edge-colouring graphs (Q1090683) (← links)
- Two conjectures on edge-colouring (Q1123197) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- Edge coloring regular graphs of high degree (Q1356779) (← links)
- How to find overfull subgraphs in graphs with large maximum degree. II (Q1594580) (← links)
- Edge-coloring critical graphs with high degree (Q1850002) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- Chromatic index of dense quasirandom graphs (Q2171027) (← links)
- Overfull conjecture for graphs with high minimum degree (Q3159391) (← links)
- An edge coloring conjecture for planar graphs (Q3976633) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
- On the inclusion chromatic index of a graph (Q6055925) (← links)
- Further split graphs known to be class 1 and a characterization of subgraph-overfull split graphs (Q6145813) (← links)