Pages that link to "Item:Q1956248"
From MaRDI portal
The following pages link to Enumerating the edge-colourings and total colourings of a regular graph (Q1956248):
Displaying 7 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Minimum number of disjoint linear forests covering a planar graph (Q405685) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- Colorings with few colors: counting, enumeration and combinatorial bounds (Q2392249) (← links)
- An efficient case for computing minimum linear arboricity with small maximum degree (Q2414123) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- (Q3323976) (← links)