Abstract
As a generalization of Harary's notion of consistency in marked graphs, we define define an even vertex coloring of a graph G as an assignment of colors to the vertices of G such that in every cycle of G there is a nonzero even number of vertices of at least one color. The even vertex coloring number v(G) of even-vertex colorable graph G is defined as the minimum number of colors in an even vertex coloring of G and a minimum even vertex coloring of G is is one which uses exactly n = v(G) colors. A characterization of minimally edge-colored graphs is obtained and a result linking the notion to bipartite Eulerian multigraphs is established.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Pure and Apllied Mathematics
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
