Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
From MaRDI portal
Publication:4865526
DOI<183::AID-JGT7>3.0.CO;2-N 10.1002/(SICI)1097-0118(199602)21:2<183::AID-JGT7>3.0.CO;2-NzbMath0838.05039OpenAlexW2073019452MaRDI QIDQ4865526
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<183::aid-jgt7>3.0.co;2-n
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
A Steinberg-like approach to describing faces in 3-polytopes ⋮ A note on the not 3-choosability of some families of planar graphs ⋮ Three-coloring planar graphs without short cycles ⋮ On 3-colorable planar graphs without cycles of four lengths ⋮ A note on 3-choosability of planar graphs ⋮ A 3-color theorem on plane graphs without 5-circuits ⋮ Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable ⋮ Steinberg's conjecture is false ⋮ A non-3-choosable planar graph without cycles of length 4 and 5 ⋮ Facially-constrained colorings of plane graphs: a survey ⋮ On doubly light triangles in plane graphs ⋮ Equitable and list equitable colorings of planar graphs without 4-cycles ⋮ (\(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 ⋮ A note on 3-choosability of plane graphs under distance restrictions ⋮ 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 ⋮ Some structural properties of planar graphs and their applications to 3-choosability ⋮ 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 ⋮ An introduction to the discharging method via graph coloring ⋮ List coloring of planar graphs with forbidden cycles ⋮ Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8 ⋮ Planar graphs without 4, 6, 8-cycles are 3-colorable ⋮ Acyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐Cycles ⋮ A relaxation of Havel's 3-color problem ⋮ A Complexity Dichotomy for the Coloring of Sparse Graphs ⋮ Planar graphs without cycles of length from 4 to 7 are 3-colorable ⋮ A note on list improper coloring planar graphs ⋮ On 3-colorings of plane graphs ⋮ 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 ⋮ A note on the acyclic 3-choosability of some planar graphs ⋮ 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 ⋮ Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable ⋮ 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 ⋮ An analogue of DP-coloring for variable degeneracy and its applications ⋮ Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable ⋮ 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 ⋮ Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable ⋮ Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable ⋮ \((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 ⋮ Acyclic choosability of planar graphs: a Steinberg like approach ⋮ A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles ⋮ On structure of some plane graphs with application to choosability ⋮ The 4-choosability of plane graphs without 4-cycles
