scientific article
From MaRDI portal
Publication:4000782
zbMath0755.05062MaRDI QIDQ4000782
Publication date: 26 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (max. 100)
A Steinberg-like approach to describing faces in 3-polytopes ⋮ Three-coloring planar graphs without short cycles ⋮ On 3-colorable planar graphs without cycles of four lengths ⋮ A 3-color theorem on plane graphs without 5-circuits ⋮ Steinberg's conjecture is false ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6 ⋮ A step towards the strong version of Havel's three color conjecture ⋮ Every signed planar graph without cycles of length from 4 to 8 is 3-colorable ⋮ Circular coloring and fractional coloring in planar graphs ⋮ Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable ⋮ Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable ⋮ Unnamed Item ⋮ Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph ⋮ Unnamed Item ⋮ Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9 ⋮ On 3-choosability of plane graphs without 6-, 7- and 9-cycles ⋮ A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits ⋮ On 3-colorable planar graphs without prescribed cycles ⋮ Distance constraints on short cycles for 3-colorability of planar graphs ⋮ The 3-colorability of planar graphs without cycles of length 4, 6 and 9 ⋮ Planar graphs without 4, 6, 8-cycles are 3-colorable ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Planar graphs without cycles of length from 4 to 7 are 3-colorable ⋮ Unnamed Item ⋮ Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable ⋮ On 3-colorability of planar graphs without adjacent short cycles ⋮ Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable ⋮ Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles ⋮ On 3-colorable planar graphs without short cycles ⋮ Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable ⋮ Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable ⋮ A note on the three color problem ⋮ Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable ⋮ A structural theorem on embedded graphs and its application to colorings ⋮ \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\) ⋮ On the 3-colorability of planar graphs without 4-, 7- and 9-cycles ⋮ Planar graphs without adjacent cycles of length at most seven are 3-colorable ⋮ A note on 3-choosability of planar graphs without certain cycles ⋮ A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
This page was built for publication:
