Graphs with bounded tree-width and large odd-girth are almost bipartite

Details Graphs with bounded tree-width and large odd-girth are almost bipartite Graphs with bounded tree-width and large odd-girth are almost bipartite

2009-04-15

arxiv.org/abs/0904.2282v1

Mathematics

Combinatorics

Scientific paper

We prove that for every $k$ and every $\varepsilon>0$, there exists $g$ such
that every graph with tree-width at most $k$ and odd-girth at least $g$ has
circular chromatic number at most $2+\varepsilon$.

Affiliated with

Also associated with

No associations

Rating

Graphs with bounded tree-width and large odd-girth are almost bipartite 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 Graphs with bounded tree-width and large odd-girth are almost bipartite, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Graphs with bounded tree-width and large odd-girth are almost bipartite will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-591767