Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

From Combinatorial Problems to Graph Colorings

Eric Andrews1, Ping Zhang1, Chira Lumduanhom1
1Department of Mathematics Western Michigan University Kalamazoo, MI 49008-5248, USA
  • Published: 28/02/2015

Abstract

Historically, a number of problems and puzzles have been introduced that initially appeared to have no connection to graph colorings but, upon further analysis, suggested graph colorings problems. In this paper, we discuss two combinatorial problems and several graph colorings problems that are inspired by these two problems. We survey recent results and open questions in this area of research as well as some relationships among these coloring parameters and well-known colorings and labelings.

Keywords: coloring, neighbor-distinguishing, vertex-distinguishing. AMS Subject Classification: 05C15, 05078.
Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Eric Andrews, Ping Zhang, Chira Lumduanhom. From Combinatorial Problems to Graph Colorings[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 090. 75-95. DOI: .