Pages that link to "Item:Q861265"
From MaRDI portal
The following pages link to List edge and list total colorings of planar graphs without 4-cycles (Q861265):
Displaying 32 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)
- List total coloring of pseudo-outerplanar graphs (Q393451) (← links)
- Total coloring of planar graphs with maximum degree 8 (Q393898) (← links)
- \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles (Q407567) (← links)
- On the total choosability of planar graphs and of sparse graphs (Q407575) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- A note on edge-choosability of planar graphs without intersecting 4-cycles (Q545596) (← links)
- Total coloring of embedded graphs of maximum degree at least ten (Q625795) (← links)
- Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles (Q641187) (← links)
- Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable (Q708386) (← links)
- Minimum choosability of planar graphs (Q724728) (← links)
- Total colorings of planar graphs without small cycles (Q937252) (← links)
- Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable (Q967320) (← links)
- List edge and list total colorings of planar graphs without short cycles (Q975488) (← links)
- Planar graphs without 5-cycles or without 6-cycles (Q1025913) (← links)
- Total colorings of planar graphs with maximum degree at least 8 (Q1043002) (← links)
- On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles (Q1043815) (← links)
- Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095) (← links)
- List-edge-coloring of planar graphs without 6-cycles with three chords (Q1702837) (← links)
- List total colorings of planar graphs without triangles at small distance (Q1942193) (← 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)
- List edge coloring of planar graphs without 6-cycles with two chords (Q2214317) (← links)
- A structural theorem for planar graphs with some applications (Q2275921) (← links)
- List edge coloring of planar graphs without non-induced 6-cycles (Q2354599) (← 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)
- Facial list colourings of plane graphs (Q2629297) (← links)
- Edge DP-coloring in planar graphs (Q2659224) (← links)
- List edge and list total coloring of planar graphs without intersecting 8-cycles (Q5034571) (← links)
- Two Chromatic Conjectures: One for Vertices and One for Edges (Q5506782) (← links)
