Pages that link to "Item:Q898165"
From MaRDI portal
The following pages link to Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165):
Displaying 16 items.
- Planar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorable (Q721920) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
- Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable (Q2000565) (← links)
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable (Q2062893) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- Every planar graph with girth at least 5 is \((1,9)\)-colorable (Q2124609) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- (Q2231768) (redirect page) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- A relaxation of the Bordeaux conjecture (Q2349972) (← links)
- The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340) (← links)
