Pages that link to "Item:Q1594580"
From MaRDI portal
The following pages link to How to find overfull subgraphs in graphs with large maximum degree. II (Q1594580):
Displaying 10 items.
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- On the chromatic index of join graphs and triangle-free graphs with large maximum degree (Q1752497) (← links)
- The P versus NP-complete dichotomy of some challenging problems in graph theory (Q1759844) (← links)
- Complexity-separating graph classes for vertex, edge and total colouring (Q2184678) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Fractionally Edge Colouring Graphs with Large Maximum Degree in Linear Time (Q2851436) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
- Edge coloring graphs with large minimum degree (Q6094039) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
