Pages that link to "Item:Q3483313"
From MaRDI portal
The following pages link to Class 1 conditions depending on the minimum degree and the number of vertices of maximum degree (Q3483313):
Displaying 15 items.
- Recent results on the total chromatic number (Q686483) (← links)
- Edge-colouring of joins of regular graphs. I (Q849137) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Graph divisible designs and packing constructions (Q897275) (← links)
- Matching divisible designs with block size four (Q898140) (← links)
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree (Q1044942) (← links)
- On the number of edge-disjoint one factors and the existence of \(k\)-factors in complete multipartite graphs (Q1126293) (← links)
- Totally critical even order graphs (Q1306315) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- The chromatic index of graphs of high maximum degree (Q1356656) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- Regular factors of simple regular graphs and factor-spectra (Q1584246) (← links)
- The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\) (Q2138974) (← links)
- Edge-colouring of join graphs (Q2369004) (← links)
- Edge-colouring of regular graphs of large degree (Q2465629) (← links)
