A 4-color theorem of the Klein bottle (Q1825877): Difference between revisions

It is well known that the chromatic number of a graph embeddable in the Klein bottle does not exceed 6. The author proves that if the girth g of such a graph satisfies \(4\leq g\leq 5\) or \(g\geq 6\) then the upper bound on the chromatic number is 4 or 3, respectively. These bounds are sharp for all g except, possibly, \(g=5.\)

0 references

Mathematics Subject Classification ID

05C10

0 references

0 references

0 references

graph embeddings

0 references

Klein bottle

0 references

chromatic number

0 references

reviewed by

Jozef Širáň

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger

0 references

103 graphs that are irreducible for the projective plane

0 references

A 4-Color Theorem for Toroidal Graphs

0 references

Some new algebraic methods in topology

0 references

Q4156452

0 references

Q3847965

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1825877

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+A Theorem of R. L. Brooks and a Conjecture of H. Hadwiger
+Normal rank
@@ Property / cites work @@
+graphs that are irreducible for the projective plane
+Normal rank
@@ Property / cites work @@
+A 4-Color Theorem for Toroidal Graphs
@@ Property / cites work: A 4-Color Theorem for Toroidal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Some new algebraic methods in topology
@@ Property / cites work: Some new algebraic methods in topology / rank @@
+Normal rank
@@ Property / cites work @@
+Q4156452
@@ Property / cites work: Q4156452 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3847965
@@ Property / cites work: Q3847965 / rank @@
+Normal rank