Skip to main content
SpringerLink
Log in

Some Conjectures and Questions in Chromatic Topological Graph Theory

  • Chapter
  • First Online:
Graph Theory

Part of the book series: Problem Books in Mathematics ((PBM))

  • 3994 Accesses

Abstract

We present a conjecture and eight open questions in areas of coloring graphs on the plane, on nonplanar surfaces, and on multiple planes. These unsolved problems relate to classical graph coloring and to list coloring for general embedded graphs and also for planar great-circle graphs and for locally planar graphs.

In Memory of Dan Archdeacon, 1954–2015, and Albert Nijenhuis, 1926-2015.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 29.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 39.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 49.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Aigner, M., Ziegler, G.M.: Proofs from the Book. Springer, Berlin (1991)

    MATH  Google Scholar 

  2. Albertson, M.O.: Open Problem 2. In: Chartrand, G., et al. (eds.) The Theory and Applications of Graphs, p. 609. Wiley, New York (1981)

    Google Scholar 

  3. Albertson, M.O., Hutchinson, J.P.: The three excluded cases of Dirac’s map-color theorem. Ann. N. Y. Acad. Sci. 319, 7–17 (1979)

    Article  MathSciNet  MATH  Google Scholar 

  4. Albertson, M.O., Hutchinson, J.P.: Extending precolorings of subgraphs of locally planar graphs. Eur. J. Comb. 25, 863–871 (2004); also ArXiv: 1602.06985v3

    Google Scholar 

  5. Albertson, M.O., Stromquist, W.: Locally planar toroidal graphs are 5-colorable. Proc. Am. Math. Soc. 84, 449–456 (1982)

    MathSciNet  MATH  Google Scholar 

  6. Appel, K., Haken, W.: Every planar map is four colorable. Bull. Am. Math. Soc. 82, 711–712 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  7. Beineke, L.W., Wilson, R.J. (eds.): Topics in Chromatic Graph Theory. Cambridge University Press, Cambridge (2015)

    MATH  Google Scholar 

  8. Bollobas, B., Catlin, P.A., Erdős, P.: Hadwiger’s conjecture is true for almost every graph. Eur. J. Comb. 1, 195–199 (1980)

    Article  MATH  Google Scholar 

  9. Bondy, A.: Beautiful conjectures in graph theory. Eur. J. Comb. 37, 4–23 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  10. Borodin, O.V.: Problems of colouring and covering the vertex set of a graph by induced subgraphs (in Russian). Ph.D. thesis, Novosibirsk State University, Novosibirsk (1979)

    Google Scholar 

  11. Boutin, D., Gethner, E., Sulanke, T.: Thickness-two graphs Part one: new nine-critical graphs, permuted layer graphs, and Catlin’s graphs. J. Graph Theory 57, 198–214 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  12. Brooks, R.L.: On colouring the nodes of a network. Proc. Camb. Philol. Soc. 37, 194–197 (1941)

    Article  MathSciNet  MATH  Google Scholar 

  13. Chenette, N., Postle, L., Streib, N., Thomas, R., Yerger, C.: Five-coloring graphs on the Klein bottle. J. Comb. Theory Ser. B 102, 1067–1098 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  14. Chudnovsky, M.: Hadwiger’s conjecture and seagull packing. Not. Am. Math. Soc. 57, 733–736 (2010)

    MathSciNet  MATH  Google Scholar 

  15. Cranston, D.W., Pruchnewski, A., Tuza, Z., Voigt, M.: List-colorings of \(K_{5}\)-minor-free graphs with special list assignments. J. Graph Theory 71, 18–30 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  16. DeVos, M., Kawarabayashi, K., Mohar, B.: Locally planar graphs are 5-choosable. J. Comb. Theory Ser. B 98, 1215–1232 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  17. Dirac, G.A.: Short proof of the map colour theorem. Can. J. Math. 9, 225–226 (1957)

    Article  MathSciNet  MATH  Google Scholar 

  18. Eshahchi, Ch., Ghebleh, M., Hajiabolhassan, H.: Some concepts in list coloring. J. Comb. Math. Comb. Comput. 41, 151–160 (2002)

    MathSciNet  MATH  Google Scholar 

  19. Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory, and Computing, Arcada, 1979. Congressus Numerantium, vol. 26, pp. 125–157. Utilitas Mathematica, Winnipeg (1997)

    Google Scholar 

  20. Felsner, S., Hurtado, F., Noy, M., Streinu, I.: Hamiltonicity and colorings of arrangement graphs. Discret. Appl. Math. 154, 2470–2483 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  21. Ferguson, H.: Mathematics in Stone and Bronze. Meridian Creative Group, Erie (1994)

    MATH  Google Scholar 

  22. Franklin, P.: A six color problem. J. Math. Phys. 13, 363–369 (1934)

    Article  MATH  Google Scholar 

  23. Gallai, T.: Kritische graphen. I. Magyar Tud. Akad. Math. Kutató Int. Közl. 8, 165–192 (1963)

    MathSciNet  MATH  Google Scholar 

  24. Gardner, M.: Mathematical games. Sci. Am. 242, 14–21 (1980)

    Article  Google Scholar 

  25. Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)

    MATH  Google Scholar 

  26. Gethner, E., Sulanke, T.: Thickness-two graphs Part two: more new nine-critical graphs, independence ratio, doubled planar graphs, and singly and doubly outerplanar graphs. Graphs Comb. 25, 197–217 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  27. Gonthier, G.: Formal proof—the four-color theorem. Not. Am. Math. Soc. 55, 1382–1393 (2008)

    MathSciNet  MATH  Google Scholar 

  28. Gross, J.L., Tucker, T.W.: Topological Graph Theory. Wiley, New York (1987)

    MATH  Google Scholar 

  29. Hadwiger, H.: Über eine Klassifikation der Streckenkomplexe. Vierteljschr. Naturforsch. Gesellsch. Zürich 88, 133–142 (1943)

    MathSciNet  MATH  Google Scholar 

  30. Heawood, P.J.: Map colour theorem. Q. J. Pure Appl. Math. 24, 332–333 (1890)

    MATH  Google Scholar 

  31. Heawood, P.J.: On the four-colour map theorem. Q. J. Pure Appl. Math. 29, 270–285 (1898)

    MATH  Google Scholar 

  32. Hutchinson, J.P.: Three-coloring graphs embedded with all faces even-sided. J. Comb. Theory Ser. B 65, 139–155 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  33. Hutchinson, J.P.: On list-coloring outerplanar graphs. J. Graph Theory 59, 59–74 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  34. Hutchinson, J.P., Richter, A.B., Seymour, P.: Colouring Eulerian triangulations. J. Comb. Theory Ser. B 84, 225–239 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  35. Jensen, T.R., Toft, B.: Graph Coloring Problems. Wiley, New York (1995)

    MATH  Google Scholar 

  36. Kawarabayashi, K., Král, D., Kynčl, J., Lidický, B.: 6-critical graphs on the Klein bottle. SIAM J. Discret. Math. 23, 372–383 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  37. Król, M.: On a necessary and sufficient condition of 3-colorability of planar graphs, I. Prace Nauk. Inst. Mat. Fiz. Teoret PWr. 6, 37–40 (1972). II, 9, 49–54 (1973)

    Google Scholar 

  38. Kündgen, A., Thomassen, C.: Spanning quadrangulations of triangulated surfaces. Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg. (to appear)

    Google Scholar 

  39. Mahdian, M., Mahmoodian, E.S.: A characterization of uniquely 2-list colorable graphs. Ars Comb. 51, 295–305 (1999)

    MathSciNet  MATH  Google Scholar 

  40. Mahmoodian, E.S., Mahdian, M.: On the uniquely list colorable graphs. Ars Comb. 59, 307–318 (2001)

    MathSciNet  MATH  Google Scholar 

  41. Mohar, B., Seymour, P.: Coloring locally bipartite graphs on surfaces. J. Comb. Theory Ser. B 84, 301–310 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  42. Mohar, B., Thomassen, C.: Graphs on Surfaces. The Johns Hopkins University Press, Baltimore (2001)

    MATH  Google Scholar 

  43. Nakamoto, A., Ozeki, K.: Coloring of locally planar graphs with one color class small. Dan Archdeacon Memorial Volume, (submitted 2015)

    Google Scholar 

  44. Nakamoto, A., Negami, S., Ota, K.: Chromatic numbers and cycle parities of quadrangulations on nonorientable closed surfaces. Discret. Math. 185, 211–218 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  45. Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms, 2nd edn. Academic, Orlando (1978). also 〈 www.math.upenn.edu/~wilf/website/CombAlgDownld.html

    Google Scholar 

  46. Postle, L., Thomas, R.: 5-list-coloring graphs on surfaces, L. Postle Ph.D. Dissertation, Georgia Institute of Technology (2012); also Hyperbolic families and coloring graphs on surfaces. Manuscript (2012)

    Google Scholar 

  47. Ringel, G.: Färbungsprobleme auf Flächen und Graphen. VEB Deutscher Verlag der Wissenschaften, Berlin (1959)

    MATH  Google Scholar 

  48. Ringel, G.: Map Color Theorem. Springer, New York (1974)

    Book  MATH  Google Scholar 

  49. Ringel, G., Youngs, J.W.T.: Solution of the Heawood map-color problem. Proc. Natl. Acad. Sci. USA 60, 438–445 (1968)

    Article  MathSciNet  MATH  Google Scholar 

  50. Robertson, N., Seymour, P., Thomas, R.: Hadwiger’s conjecture for \(K_{6}\)-free graphs. Combinatorica 13, 279–361 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  51. Robertson, N., Sanders, D.P., Seymour, P., Thomas, R.: A new proof of the four-colour theorem. Electron. Res. Announc. Am. Math. Soc. 2, 17–25 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  52. Thomassen, C.: Five-coloring maps on surfaces. J. Comb. Theory Ser. B 59, 89–105 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  53. Thomassen, C.: Every planar graph is 5-choosable. J. Comb. Theory Ser. B 62, 180–181 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  54. Toft, B.: Survey of Hadwiger’s conjecture. Congr. Numer. 115, 241–252 (1996)

    MathSciNet  MATH  Google Scholar 

  55. Vizing, V.G.: Vertex colorings with given colors (in Russian). Metody Diskret. Analiz 29, 3–10 (1976)

    MathSciNet  Google Scholar 

  56. Voigt, M.: List colourings of planar graphs. Discret. Math. 120, 215–219 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  57. Wagner, K.: Über eine Eigenschaft der ebenen Komplexe. Math. Ann. 114, 570–590 (1937)

    Article  MathSciNet  MATH  Google Scholar 

  58. Wagon, S.: Mathematica in Action, 3rd edn. Springer, New York (2010)

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, Statistics, and Computer Science, Macalester College, St. Paul, MN, 55105, USA

    Joan P. Hutchinson

Authors
  1. Joan P. Hutchinson
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Joan P. Hutchinson .

Editor information

Editors and Affiliations

  1. Department of Applied Mathematics, Naval Postgraduate School, Monterey, California, USA

    Ralucca Gera

  2. School of Computing, Clemson University, Clemson, South Carolina, USA

    Stephen Hedetniemi

  3. Department of Mathematics, Virginia Commonwealth University, Richmond, Virginia, USA

    Craig Larson

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this chapter

Cite this chapter

Hutchinson, J.P. (2016). Some Conjectures and Questions in Chromatic Topological Graph Theory. In: Gera, R., Hedetniemi, S., Larson, C. (eds) Graph Theory. Problem Books in Mathematics. Springer, Cham. https://doi.org/10.1007/978-3-319-31940-7_12

Download citation

Publish with us

Policies and ethics

Search

Navigation