Some topological methods in graph coloring theory

MaRDI QIDQ2816122zbMATH OpenFDO

Authors Bojan Mohar

Publication date 1 July 2016

Full work available at URL http://www.sciencedirect.com/science/article/pii/S1571065305801726?np=y

zbMATH Keywords

coloringcritical graphEuler's formulahomotopyKempe equivalencelocal planaritysurfacewinding number

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited in

(7)

• Topology of acyclic complexes of tournaments and coloring
• On the use of some known methods for \(T\)-colorings of graphs
• scientific article; zbMATH DE number 437484 (Why is no real title available?)
• scientific article; zbMATH DE number 3855142 (Why is no real title available?)
• scientific article; zbMATH DE number 3926942 (Why is no real title available?)
• Planarity and genus of sparse random bipartite graphs
• Some Conjectures and Questions in Chromatic Topological Graph Theory

This page was built for publication: Some topological methods in graph coloring theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2816122)