Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
From MaRDI portal
DOI10.1002/(SICI)1097-0118(199602)21:2%3C183::AID-JGT7%3E3.0.CO;2-NzbMATH Open0838.05039OpenAlexW2073019452MaRDI QIDQ4865526FDOQ4865526
Authors: Oleg V. Borodin 
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C183::aid-jgt7%3E3.0.co;2-n
Recommendations
- Planar graphs without triangles adjacent to cycles of length from 3 to 9 are 3-colorable
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Cited In (68)
- Three coloring via triangle counting
- Light 3-faces in 3-polytopes without adjacent triangles
- An analogue of DP-coloring for variable degeneracy and its applications
- The surviving rate of planar graphs without short cycles
- Acyclic choosability of planar graphs: a Steinberg like approach
- (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6
- A note on 3-choosability of planar graphs
- Planar graphs without 4-cycles adjacent to 3-cycles are list vertex 2-arborable
- Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable
- Correspondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8
- Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable
- A note on 3-choosability of planar graphs without certain cycles
- The 4-choosability of plane graphs without 4-cycles
- Triangles with restricted degree sum of their boundary vertices in plane graphs
- A condition for the three colourability of planar locally path graphs
- Planar graphs without 4, 6, 8-cycles are 3-colorable
- Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests
- A note on list improper coloring planar graphs
- Every toroidal graph without adjacent triangles is \((4,1)^{*}\)-choosable
- On doubly light triangles in plane graphs
- Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
- A note on the acyclic 3-choosability of some planar graphs
- Acyclic 4-choosability of planar graphs with no 4- and 5-cycles
- Facially-constrained colorings of plane graphs: a survey
- Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
- On structure of some plane graphs with application to choosability
- A Steinberg-like approach to describing faces in 3-polytopes
- Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable
- Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
- Plane Triangulations Without a Spanning Halin Subgraph: Counterexamples to the Lovász--Plummer Conjecture on Halin Graphs
- Circular coloring and fractional coloring in planar graphs
- Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
- Total colorings of planar graphs without adjacent triangles
- The 3-colorability of planar graphs without cycles of length 4, 6 and 9
- A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles
- Every planar graph without cycles of lengths 4 to 12 is acyclically 3-choosable
- A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits
- Three-coloring planar graphs without short cycles
- Steinberg's conjecture is false
- On 3-colorability of planar graphs without adjacent short cycles
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles
- On 3-colorings of plane graphs
- On 3-colorable planar graphs without short cycles
- A note on the not 3-choosability of some families of planar graphs
- On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
- Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable
- Every signed planar graph without cycles of length from 4 to 8 is 3-colorable
- A non-3-choosable planar graph without cycles of length 4 and 5
- A step towards the strong version of Havel's three color conjecture
- On 3-choosability of plane graphs without 6-, 7- and 9-cycles
- Distance constraints on short cycles for 3-colorability of planar graphs
- Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorable
- A structural theorem on embedded graphs and its application to colorings
- A note on 3-choosability of plane graphs under distance restrictions
- Planar graphs without cycles of length from 4 to 7 and intersecting triangles are DP-3-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
- Some structural properties of planar graphs and their applications to 3-choosability
- An introduction to the discharging method via graph coloring
- List coloring of planar graphs with forbidden cycles
- A relaxation of Havel's 3-color problem
- A Complexity Dichotomy for the Coloring of Sparse Graphs
- Planar graphs without adjacent cycles of length at most seven are 3-colorable
- \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
- Planar graphs without cycles of length from 4 to 7 are 3-colorable
- Equitable and list equitable colorings of planar graphs without 4-cycles
- On 3-colorable planar graphs without cycles of four lengths
- A 3-color theorem on plane graphs without 5-circuits
- On 3-colorable planar graphs without prescribed cycles
This page was built for publication: Structural properties of plane graphs without adjacent triangles and an application to 3-colorings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865526)
