Folding = Colouring

Details Folding = Colouring Folding = Colouring

2008-02-18

arxiv.org/abs/0802.2467v2

Mathematics

Combinatorics

I have discovered that the main result was first proved by Cook and Evans in 1979

Scientific paper

The foldings of a connected graph $G$ are defined as follows. First, $G$ is a
folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two
vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$.
The folding number of $G$ is the minimum order of a complete folding of $G$.
Theorem: The folding number of every graph equals its chromatic number.

Affiliated with

Also associated with

No associations

Rating

Folding = Colouring does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Folding = Colouring, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Folding = Colouring will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-197789