A necessary condition for four-coloring a planar graph

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

For the vertices of a finite 4-colored planar graph, regular of degree three, certain orientation indices are defined and studied. A connection is shown some elementary combinatorial results in fixed point theory. © 1966 Academic Press Inc.

Cite

CITATION STYLE

APA

Baxter, G. (1966). A necessary condition for four-coloring a planar graph. Journal of Combinatorial Theory, 1(3), 375–384. https://doi.org/10.1016/S0021-9800(66)80058-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free