Pages that link to "Item:Q396727"
From MaRDI portal
The following pages link to Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees (Q396727):
Displaying 11 items.
- Domination game critical graphs (Q891326) (← links)
- Edge coloring of graphs with small maximum degrees (Q1044957) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- On the size of edge chromatic 5-critical graphs (Q2409770) (← links)
- A new lower bound on critical graphs with maximum degree of 8 and 9. (Q2881261) (← links)
- (Q3399346) (← links)
- REMARKS ON EDGE CRITICAL GRAPHS WITH MAXIMUM DEGREE OF 3 AND 4 (Q5076249) (← links)
- (Q5413523) (← links)
- Rainbow vertex-connection and graph products (Q5739599) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)