Pages that link to "Item:Q2371269"
From MaRDI portal
The following pages link to Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable (Q2371269):
Displaying 27 items.
- Steinberg's conjecture is false (Q345097) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- An extension of DHH-Erdős conjecture on cycle-plus-triangle graphs (Q698558) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable (Q738860) (← links)
- Planar 4-critical graphs with four triangles (Q740268) (← links)
- 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor (Q1045075) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- A sufficient condition for planar graphs to be 3-colorable (Q1405097) (← links)
- 3-coloring triangle-free planar graphs with a precolored 9-cycle (Q1678087) (← links)
- Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable (Q1690217) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- A relaxation of Novosibirsk 3-color conjecture (Q2075515) (← links)
- A note on a conjecture of Wu, Xu and Xu (Q2109109) (← links)
- Every planar graph without triangles adjacent to cycles of length 3 or 6 is \(( 1 , 1 , 1 )\)-colorable (Q2174590) (← links)
- Decomposing a planar graph without triangular 4-cycles into a matching and a 3-colorable graph (Q2274084) (← links)
- A 3-color theorem on plane graphs without 5-circuits (Q2644333) (← links)
- 3-Coloring Triangle-Free Planar Graphs with a Precolored 9-Cycle (Q2946045) (← links)
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable (Q3067058) (← links)
- The color space of a graph (Q4500710) (← links)
- 3-Paintability of planar graphs (Q4554554) (← links)
- Structural properties of plane graphs without adjacent triangles and an application to 3-colorings (Q4865526) (← links)
