Pages that link to "Item:Q2323251"
From MaRDI portal
The following pages link to Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251):
Displaying 6 items.
- On purely tree-colorable planar graphs (Q280945) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← links)
- The Strong Fractional Choice Number and the Strong Fractional Paint Number of Graphs (Q5048297) (← links)
- Fractional coloring planar graphs under Steinberg-type conditions (Q6113758) (← links)
- Fractional coloring with local demands and applications to degree-sequence bounds on the independence number (Q6615757) (← links)