Pages that link to "Item:Q641187"
From MaRDI portal
The following pages link to Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187):
Displaying 17 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- List edge and list total coloring of planar graphs with maximum degree 8 (Q328709) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- List edge and list total colorings of planar graphs without 4-cycles (Q861265) (← links)
- Edge and total choosability of near-outerplanar graphs (Q870017) (← links)
- Structural properties and edge choosability of planar graphs without 4-cycles (Q998462) (← links)
- Total equitable list coloring (Q1756126) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- The list edge coloring and list total coloring of planar graphs with maximum degree at least 7 (Q2194528) (← links)
- Optimal channel assignment with list-edge coloring (Q2424801) (← links)
- A note on list edge and list total coloring of planar graphs without adjacent short cycles (Q2440495) (← links)
- Planar graphs with \(\Delta \geq 7\) and no triangle adjacent to a \(C_{4}\) are minimally edge and total choosable (Q2808541) (← links)
- (Q4680036) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- (Q5081905) (← links)
- Edge-choosability and total-choosability of planar graphs with no adjacent 3-cycles (Q5324109) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
