SEARCH

SEARCH BY CITATION

REFERENCES

  • 1
    O. V. Borodin, Representing K13 as a 2-pire map on the Klein bottle, J Reine Angew Math 393(1989), 132133.
  • 2
    M. Gardner, Mathematical games, Sci Am 242 (1980), 1421.
  • 3
    N. Hartsfield, The quadrangular genus of complete graphs, preprint.
  • 4
    P. J. Heawood, Map color theorem, Quart J Pure Appl Math 24 (1890), 332338.
  • 5
    J. P. Hutchinson, On coloring maps made from Eulerian graphs, Proceeding of 5th British Combinatorial Conference (1975), pp. 343354.
  • 6
    J. P. Hutchinson, Three-coloring graphs embedded on surfaces with all faces even-sided, J Combin Theory Ser B 65 (1995), 139155.
  • 7
    B. Jackson and G. Ringel, Maps of m-pires on the projective plane, Discrete Math 46 (1983), 1520.
  • 8
    B. Jackson and G. Ringel, Solution of Heawood's empire problem in the plane, J Reine Angew Math 347 (1984), 146153.
  • 9
    B. Jackson and G. Ringel, Heawood's empire problem, J Combin Theory Ser B 38 (1985), 168178.
  • 10
    T. R. Jensen and B. Toft, Graph coloring problems, Wiley Interscience, New York, 1995.
  • 11
    A. Nakamoto and N. Sasanuma, Three-colorable even embeddings on closed surfaces, Graphs Combin 23 (2007), 8795.
  • 12
    G. Ringel, Färbungsprobleme auf flächen und graphen, VEB Deutscher Verlag der Wissenschaften, 1959 (in German).
  • 13
    H. Taylor, Synchronization patterns and related problems in combinatorial analysis and graph theory, Technical Report 509, University of Southern California Electronic Science Laboratory, 1981.