Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs

Details Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs

2007-04-20

arxiv.org/abs/0704.2650v1

Mathematics

Combinatorics

11 pages, 2 figures

Scientific paper

An interval coloring of a graph G is a proper coloring of E(G) by positive integers such that the colors on the edges incident to any vertex are consecutive. A (3,4)-biregular bigraph is a bipartite graph in which each vertex of one part has degree 3 and each vertex of the other has degree 4; it is unknown whether these all have interval colorings. We prove that G has an interval coloring using 6 colors when G is a (3,4)-biregular bigraph having a spanning subgraph whose components are paths with endpoints at 3-valent vertices and lengths in {2,4,6,8}. We provide sufficient conditions for the existence of such a subgraph.

Affiliated with

Also associated with

No associations

Rating

Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs 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 Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-573321