One-sided interval edge-colorings of bipartite graphs
详细信息    查看全文
文摘
Let 547665b" title="Click to view the MathML source">G be a bipartite graph with bipartition (X,Y). An X-interval coloring of 547665b" title="Click to view the MathML source">G is a proper edge-coloring of 547665b" title="Click to view the MathML source">G by integers such that the colors on the edges incident to any vertex in X form an interval. Denote by View the MathML source the minimum e178e8d721ca94cd95e5c174b11" title="Click to view the MathML source">k such that 547665b" title="Click to view the MathML source">G has an X-interval coloring with e178e8d721ca94cd95e5c174b11" title="Click to view the MathML source">k colors. In this paper we give various upper and lower bounds on View the MathML source in terms of the vertex degrees of 547665b" title="Click to view the MathML source">G. We also determine View the MathML source exactly for some classes of bipartite graphs 547665b" title="Click to view the MathML source">G. Furthermore, we present upper bounds on View the MathML source for classes of bipartite graphs 547665b" title="Click to view the MathML source">G with maximum degree 54" title="Click to view the MathML source">Δ(G) at most 9: in particular, if 4e1b90bcd7cae4099537866" title="Click to view the MathML source">Δ(G)=4, then View the MathML source; if Δ(G)=5, then View the MathML source; if Δ(G)=6, then View the MathML source.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700