Pages that link to "Item:Q3504798"
From MaRDI portal
The following pages link to Some totally 4-choosable multigraphs (Q3504798):
Displaying 7 items.
- Total choosability of planar graphs with maximum degree 4 (Q617905) (← links)
- On the choice number of complete multipartite graphs with part size four (Q739044) (← links)
- Total 4-choosability of series-parallel graphs (Q870016) (← links)
- The average degree of a multigraph critical with respect to edge or total choosability (Q966012) (← links)
- Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable (Q1043786) (← links)
- Facial list colourings of plane graphs (Q2629297) (← links)
- Adaptable and conflict colouring multigraphs with no cycles of length three or four (Q6047975) (← links)