Pages that link to "Item:Q1767673"
From MaRDI portal
The following pages link to Planar graphs without cycles of length from 4 to 7 are 3-colorable (Q1767673):
Displayed 50 items.
- Steinberg's conjecture is false (Q345097) (← links)
- Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable (Q393460) (← links)
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 (Q394211) (← links)
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph (Q458589) (← links)
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits (Q477505) (← links)
- Distance constraints on short cycles for 3-colorability of planar graphs (Q497344) (← links)
- \((1,0,0)\)-colorability of planar graphs without prescribed short cycles (Q498436) (← links)
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9 (Q501066) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- List coloring of planar graphs with forbidden cycles (Q510959) (← links)
- Some structural properties of planar graphs and their applications to 3-choosability (Q658061) (← links)
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 (Q684119) (← links)
- On 3-colorings of plane graphs (Q705042) (← links)
- A note on the acyclic 3-choosability of some planar graphs (Q708344) (← links)
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable (Q709301) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- 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 short even cycles are near-bipartite (Q777449) (← links)
- A note on the not 3-choosability of some families of planar graphs (Q845679) (← links)
- Three-coloring planar graphs without short cycles (Q845915) (← links)
- On 3-colorable plane graphs without 5- and 7-cycles (Q859619) (← links)
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable (Q898156) (← links)
- Planar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorable (Q898165) (← links)
- Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable (Q932660) (← links)
- On 3-colorability of planar graphs without adjacent short cycles (Q977289) (← links)
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable (Q990957) (← links)
- On 3-colorable planar graphs without short cycles (Q998606) (← links)
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable (Q1026007) (← links)
- A structural theorem on embedded graphs and its application to colorings (Q1034219) (← links)
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles (Q1043995) (← links)
- Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable (Q1045155) (← links)
- Planar graphs without adjacent cycles of length at most seven are 3-colorable (Q1045158) (← links)
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable (Q1686009) (← links)
- A step towards the strong version of Havel's three color conjecture (Q1931401) (← links)
- Fast 3-coloring triangle-free planar graphs (Q1957652) (← links)
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable (Q2012890) (← links)
- Planar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorable (Q2021579) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) (Q2075512) (← links)
- A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles (Q2092419) (← links)
- Building a maximal independent set for the vertex-coloring problem on planar graphs (Q2133444) (← links)
- Planar graphs without 4- and 6-cycles are (7 : 2)-colorable (Q2185814) (← 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)
- Every planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorable (Q2279984) (← links)
- A refinement of choosability of graphs (Q2284741) (← links)
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable (Q2319718) (← links)
- Every planar graph without adjacent cycles of length at most 8 is 3-choosable (Q2323250) (← links)
- Note on 3-choosability of planar graphs with maximum degree 4 (Q2324500) (← links)
