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

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

  1. 1、本文档共10页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Proper path-factors and interval edge-coloring of (3,4)-biregular bigraphs

a r X i v : 0 7 0 4 .2 6 5 0 v 1 [ m a t h .C O ] 2 0 A p r 2 0 0 7 Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs Armen S. Asratian?, Carl Johan Casselgren?, Jennifer Vandenbussche?, Douglas B. West§ April 6, 2007 Abstract 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. Keywords: path factor, interval edge-coloring, biregular bipartite graph AMSclass: 05C15, 05C70 1 Introduction An interval coloring or consecutive coloring of a graph G is a proper coloring of the edges of G by positive integers such that the colors on the edges incident to any vertex are consecutive. The notion was introduced by Asratian and Kamalian [2] (available in English as [3]), motivated by the problem of constructing timetables without “gaps” for teachers and classes. Hansen [9] suggested another scenario: a school wishes to schedule parent-teacher conferences in time slots so that every person’s conferences occur in consecutive slots. A solution exists if and only if the bipartite graph with vertices for the people and edges for the required meetings has an interval coloring. ?Linko?ping University, Linko?ping Sweden, arasr@mai.liu.se. ?Ume?a University, Ume?a , Sweden, carl-johan.casselgren@math.umu.se. ?University of Illinois, Urbana, IL, jarobin1@math.uiuc.edu. §University of Illinois, Urbana, IL, west@math.uiuc.edu. Work supported in part by the NSA under Award No. H98230-0

文档评论(0)

l215322 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档