Pages that link to "Item:Q2808541"
From MaRDI portal
The following pages link to Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable (Q2808541):
Displaying 6 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- An AIMMS-based decision-making model for optimizing the intelligent stowage of export containers in a single bay (Q2321669) (← links)
- Analysis of the clustering fusion algorithm for multi-band color image (Q2321687) (← links)
- Planar graphs with maximum degree D at least 8 are (D+1)-edge-choosable (Q5419972) (← links)