A new proof of the 6 color theorem

From MaRDI portal
Publication:4842705

DOI10.1002/jgt.3190190406zbMath0826.05027OpenAlexW1964342669MaRDI QIDQ4842705

Oleg V. Borodin

Publication date: 16 August 1995

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190190406




Related Items

Edge-pancyclicity of coupled graphsThe entire choosability of plane graphsTotal coloring of 1-toroidal graphs with maximum degree at least 11 and no adjacent trianglesAn improved upper bound on the linear 2-arboricity of 1-planar graphsFacial list colourings of plane graphsThird case of the cyclic coloring conjectureRecognizing and embedding simple optimal 2-planar graphsColoring vertices and faces of locally planar graphsCyclic 4-Colorings of Graphs on SurfacesContractions, cycle double covers, and cyclic colorings in locally connected graphsOn edge colorings of 1-toroidal graphsColorings of plane graphs without long monochromatic facial pathsFacially-constrained colorings of plane graphs: a surveyDynamic list coloring of 1-planar graphsEntire coloring of 2-connected plane graphsCyclic coloring of plane graphs with maximum face size 16 and 17An annotated bibliography on 1-planarityProper 1-immersions of graphs triangulating the planePlane graphs with \(\Delta = 7\) are entirely 10-colorableOn drawings and decompositions of 1-planar graphs1-planar graphs are odd 13-colorableA note on 1-planar graphsThe structure of plane graphs with independent crossings and its applications to coloring problemsAll 2-planar graphs having the same spanning subgraphOn the edge-connectivity and restricted edge-connectivity of optimal 1-planar graphsThe family of fan-planar graphsAn improved upper bound for the acyclic chromatic number of 1-planar graphs1-planarity of complete multipartite graphsWeak-dynamic coloring of graphs beyond-planarityIC-planar graphs are odd-10-colorableOn the Density of Non-simple 3-Planar GraphsThe linear 2-arboricity of IC-planar graphsCoverage with \(k\)-transmitters in the presence of obstaclesA note on odd colorings of 1-planar graphsA new note on 1-planar graphs with minimum degree 7\(\mathsf{T}\)-shape visibility representations of 1-planar graphsShifting Coresets: Obtaining Linear-Time Approximations for Unit Disk Graphs and Other Geometric Intersection GraphsOn the cyclic coloring conjectureA survey on the cyclic coloring and its relaxationsEntire colouring of plane graphsOn \((p,1)\)-total labelling of 1-planar graphsList 2-facial 5-colorability of plane graphs with girth at least 12Drawing complete multipartite graphs on the plane with restrictions on crossingsOn \((p, 1)\)-total labelling of some 1-planar graphsCyclic colorings of plane graphs with independent facesMinimal non-1-planar graphsEquitable coloring of three classes of 1-planar graphsEntire coloring of graphs embedded in a surface of nonnegative characteristicLight subgraphs in the family of 1-planar graphs with high minimum degreeA structure of 1-planar graph and its applications to coloring problemsList edge and list total coloring of 1-planar graphsFacial colorings using Hall's theoremCyclic, diagonal and facial coloringsColoring plane graphs with independent crossingsAcyclic colouring of 1-planar graphsThird Case of the Cyclic Coloring ConjectureMinimal Obstructions for 1-Immersions and Hardness of 1-Planarity TestingPlanar graphs having no proper 2-immersions in the plane. INote on improper coloring of $1$-planar graphsEquitable partition of plane graphs with independent crossings into induced forestsFacial rainbow coloring of plane graphsA general upper bound for the cyclic chromatic number of 3‐connected plane graphsLight structures in 1-planar graphs with an application to linear 2-arboricityAcyclic coloring of IC-planar graphsQuantitative Restrictions on Crossing Patterns$$\textit{\textbf{k}}$$-Planar GraphsOn cyclic colorings and their generalizationsIC-Planar Graphs Are 6-ChoosableColoring the faces of convex polyhedra so that like colors are far apartThe linear 2-arboricity of 1-planar graphs without 3-cyclesOn total colorings of 1-planar graphs