skip to content
Cyclic Coloration of 3-Polytopes. Preview this item
ClosePreview this item
Checking...

Cyclic Coloration of 3-Polytopes.

Author: Michael D Plummer; Bjarne Toft; VANDERBILT UNIV NASHVILLE TN.
Publisher: Ft. Belvoir Defense Technical Information Center JAN 1985.
Edition/Format:   Book : English
Database:WorldCat
Summary:
This paper, all graphs will be finite, loopless and will have no parallel lines. Let G be a 2-connected planar graph with <V(G)>=p points. Suppose G has some fixed imbedding Phi: G approaches R-sq in the plane. The pair (G Phi) is often called a plane graph. A cyclic coloration of (G Phi) is an assignment to colors to the points of G such that for any face-bounding cycle F of (G Phi), the points of F have  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: Michael D Plummer; Bjarne Toft; VANDERBILT UNIV NASHVILLE TN.
OCLC Number: 227691606
Description: 14 p.

Abstract:

This paper, all graphs will be finite, loopless and will have no parallel lines. Let G be a 2-connected planar graph with <V(G)>=p points. Suppose G has some fixed imbedding Phi: G approaches R-sq in the plane. The pair (G Phi) is often called a plane graph. A cyclic coloration of (G Phi) is an assignment to colors to the points of G such that for any face-bounding cycle F of (G Phi), the points of F have different colors. The cyclic coloration number chi sub c ((G Phi)) is the minimum number of colors in any cyclic coloration of (G, Phi). The main result of the present paper is to show that if (G, Phi) is a 3-connected plane graph, then chi sub c (G, Phi) <p* (G, Phi)+ 9. Moreover, if rho* is sufficiently large of sufficiently large or sufficiently small, then this bound on chi sub c can be improved somewhat.

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/227691606>
library:oclcnum"227691606"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:about
schema:contributor
schema:contributor
schema:contributor
schema:datePublished"JAN 1985"
schema:datePublished"1985"
schema:description"This paper, all graphs will be finite, loopless and will have no parallel lines. Let G be a 2-connected planar graph with =p points. Suppose G has some fixed imbedding Phi: G approaches R-sq in the plane. The pair (G Phi) is often called a plane graph. A cyclic coloration of (G Phi) is an assignment to colors to the points of G such that for any face-bounding cycle F of (G Phi), the points of F have different colors. The cyclic coloration number chi sub c ((G Phi)) is the minimum number of colors in any cyclic coloration of (G, Phi). The main result of the present paper is to show that if (G, Phi) is a 3-connected plane graph, then chi sub c (G, Phi) "@en
schema:exampleOfWork<http://worldcat.org/entity/work/id/137390513>
schema:inLanguage"en"
schema:name"Cyclic Coloration of 3-Polytopes."@en
schema:numberOfPages"14"
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.