Realizing the chromatic numbers of triangulations of surfaces (Q1313860): Difference between revisions

For every closed 2-manifold \(S\) (whether orientable or nonorientable) and integer \(n\), \(3 \leq n \leq \chi(S)\), the chromatic number of \(S\), the authors construct a triangular imbedding of a graph \(G\) in \(S\) such that \(n=\chi(G)\), the chromatic number of \(G\).

0 references

Mathematics Subject Classification ID

05C10

0 references

0 references

0 references

closed 2-manifold

0 references

chromatic number

0 references

triangular imbedding

0 references

reviewed by

Arthur T. White

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Every planar map is four colorable. I: Discharging

0 references

Every planar map is four colorable. II: Reducibility

0 references

Parallel concepts in graph theory

0 references

Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen

0 references

SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

0 references

Q4156452

0 references

Q3847965

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1313860

@@ Property / cites work @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+Parallel concepts in graph theory
@@ Property / cites work: Parallel concepts in graph theory / rank @@
+Normal rank
@@ Property / cites work @@
+Bestimmung der Maximalzahl der Nachbargebiete auf nicht-orientierbaren Flächen
+Normal rank
@@ Property / cites work @@
+SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
@@ Property / cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM / 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