Pages that link to "Item:Q2685340"

The following pages link to The \((3, 3)\)-colorability of planar graphs without 4-cycles and 5-cycles (Q2685340):

Displaying 22 items.

• Three-colourability of planar graphs with no 5- or triangular \(\{3,6\}\)-cycles (Q324868) (← links)
• Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
• The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
• Cycle adjacency of planar graphs and 3-colourability (Q647258) (← links)
• A counterexample to the conjecture of Aksionov and Mel'nikov on non-3- colorable planar graphs (Q793751) (← links)
• Three-coloring planar graphs without short cycles (Q845915) (← links)
• On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
• Defective 2-colorings of planar graphs without 4-cycles and 5-cycles (Q1637126) (← links)
• Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
• Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable (Q1988563) (← links)
• New restrictions on defective coloring with applications to Steinberg-type graphs (Q2185826) (← links)
• Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests (Q2219964) (← 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)
• Planar graphs without cycles of length 4 or 5 are \((11 : 3)\)-colorable (Q2323251) (← links)
• On 3-colorable planar graphs without cycles of four lengths (Q2379960) (← links)
• On the 3-colorability of planar graphs without \(\{4,8,9\}\)-cycles (Q2859766) (← links)
• (Q4625641) (← links)
• (Q4797465) (← links)
• A weak DP-partitioning of planar graphs without 4-cycles and 6-cycles (Q6173908) (← links)
• Planar graphs without 4- and 6-cycles are \(( 3 , 4 )\)-colorable (Q6585244) (← links)
• Partitioning planar graphs into bounded degree forests (Q6585546) (← links)