Pages that link to "Item:Q1045095"
From MaRDI portal
The following pages link to Total colorings and list total colorings of planar graphs without intersecting 4-cycles (Q1045095):
Displaying 30 items.
- A note on the minimum number of choosability of planar graphs (Q266020) (← links)
- Total coloring of planar graphs without chordal 7-cycles (Q272520) (← links)
- Total coloring of planar graphs without short cycles (Q281812) (← 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)
- A note on the total coloring of planar graphs without adjacent 4-cycles (Q427837) (← links)
- (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles (Q432709) (← links)
- Total colorings of planar graphs without intersecting 5-cycles (Q444447) (← links)
- Minimum total coloring of planar graph (Q475814) (← links)
- Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q476647) (← links)
- Total coloring of planar graphs without chordal short cycles (Q497376) (← links)
- Total coloring of planar graphs without adjacent short cycles (Q512886) (← links)
- Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles (Q641163) (← 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 embedded graphs with no 3-cycles adjacent to 4-cycles (Q1656911) (← links)
- Planar graphs with maximum degree 8 and without intersecting chordal 4-cycles are 9-totally colorable (Q1934390) (← links)
- \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle (Q1944131) (← links)
- List edge colorings of planar graphs without adjacent 7-cycles (Q2035728) (← links)
- Total tessellation cover: bounds, hardness, and applications (Q2091795) (← links)
- A structural theorem for planar graphs with some applications (Q2275921) (← links)
- Total coloring of planar graphs without adjacent chordal 6-cycles (Q2410046) (← 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)
- Total colorings of planar graphs without chordal 6-cycles (Q2449112) (← links)
- A sufficient condition for planar graphs with maximum degree 8 to be 9-totally colorable (Q2453854) (← links)
