Planar graphs without cycles of length from 4 to 7 are 3-colorable

From MaRDI portal
Publication:1767673

DOI10.1016/j.jctb.2004.11.001zbMath1056.05052OpenAlexW2033177498MaRDI QIDQ1767673

Alekseĭ Nikolaevich Glebov, Mohammad R. Salavatipour, Oleg V. Borodin, Andre Raspaud

Publication date: 8 March 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2004.11.001




Related Items (max. 100)

A Steinberg-like approach to describing faces in 3-polytopesBuilding a maximal independent set for the vertex-coloring problem on planar graphsA note on the not 3-choosability of some families of planar graphsThree-coloring planar graphs without short cyclesOn 3-colorable planar graphs without cycles of four lengthsA note on 3-choosability of planar graphs3-Paintability of planar graphsA 3-color theorem on plane graphs without 5-circuitsOn 3-colorable plane graphs without 5- and 7-cyclesSteinberg's conjecture is falseFacially-constrained colorings of plane graphs: a surveyPlanar graphs without \(\{4, 6, 8\}\)-cycles are 3-choosableA Note on the Minimum H-Subgraph Edge DeletionPlanar graphs without cycles of length 4 or 5 are (3,0,0)-colorable(\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6A step towards the strong version of Havel's three color conjecturePlanar graphs without 4- and 6-cycles are (7 : 2)-colorableNew restrictions on defective coloring with applications to Steinberg-type graphsEvery signed planar graph without cycles of length from 4 to 8 is 3-colorableCircular coloring and fractional coloring in planar graphsPlane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-ColorableMapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$Every planar graph without 4-cycles and 5-cycles is (3,3)-colorableFractional coloring planar graphs under Steinberg-type conditionsPlanar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorablePlanar graphs without 5-cycles and intersecting triangles are \((1, 1, 0)\)-colorableUnnamed ItemShort proofs of coloring theorems on planar graphsFast 3-coloring triangle-free planar graphsDecomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graphUnnamed ItemPartitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests(Circular) backbone colouring: forest backbones in planar graphs\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9Some structural properties of planar graphs and their applications to 3-choosabilityA sufficient condition on 3-colorable plane graphs without 5- and 6-circuitsPlane graphs without cycles of length 4, 6, 7 or 8 are 3-colorableOn 3-colorable planar graphs without prescribed cyclesDistance constraints on short cycles for 3-colorability of planar graphs\((1,0,0)\)-colorability of planar graphs without prescribed short cyclesThe 3-colorability of planar graphs without cycles of length 4, 6 and 9An introduction to the discharging method via graph coloringList coloring of planar graphs with forbidden cyclesCorrespondence coloring and its application to list-coloring planar graphs without cycles of lengths 4 to 8Planar graphs without 4, 6, 8-cycles are 3-colorableAcyclic 4‐Choosability of Planar Graphs with No 4‐ and 5‐CyclesA Complexity Dichotomy for the Coloring of Sparse GraphsUnnamed ItemOn 3-colorings of plane graphsEvery planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1, 1, 0)-colorableOn 3-colorability of planar graphs without adjacent short cyclesA note on the acyclic 3-choosability of some planar graphsPlanar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorableAcyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cyclesPlanar graphs without adjacent cycles of length at most five are (2, 0, 0)-colorablePlanar graphs without 4-cycles and close triangles are \((2,0,0)\)-colorableEvery planar graph without cycles of lengths 4 to 12 is acyclically 3-choosableEvery planar graph without 5-cycles and \(K_4^-\) and adjacent 4-cycles is \((2, 0, 0)\)-colorableComplexity and algorithms for injective edge-coloring in graphsA refinement of choosability of graphsOn 3-colorable planar graphs without short cyclesPlanar graphs with neither 5-cycles nor close 3-cycles are 3-colorablePlanar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorablePlanar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorableA NOTE ON 3-COLORABLE PLANE GRAPHS WITHOUT 5- AND 7-CYCLESA structural theorem on embedded graphs and its application to coloringsPlanar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable\((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)Every planar graph without adjacent cycles of length at most 8 is 3-choosableNote on 3-choosability of planar graphs with maximum degree 4Planar graphs without short even cycles are near-bipartiteOn the 3-colorability of planar graphs without 4-, 7- and 9-cyclesPlanar graphs without cycles of length 4, 5, 8, or 9 are 3-choosablePlanar graphs without adjacent cycles of length at most seven are 3-colorableA note on 3-choosability of planar graphs without certain cyclesAcyclic choosability of planar graphs: a Steinberg like approachA note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cyclesA relaxation of the Bordeaux conjecture



Cites Work


This page was built for publication: Planar graphs without cycles of length from 4 to 7 are 3-colorable