首页 | 本学科首页   官方微博 | 高级检索  
     

4-圈不共点的平面图的线性2-荫度
引用本文:陈宏宇,张丽. 4-圈不共点的平面图的线性2-荫度[J]. 山东大学学报(理学版), 2017, 52(12): 36-41. DOI: 10.6040/j.issn.1671-9352.0.2016.597
作者姓名:陈宏宇  张丽
作者单位:1. 上海应用技术大学理学院, 上海 201418;2. 上海立信会计金融学院统计与数学学院, 上海 201209
基金项目:国家自然科学基金青年科学基金资助项目(11401386)
摘    要:图G的线性2-荫度la2(G)是指可以使G分解为k个边不相交森林的最小整数k, 其中森林的每个分支是长度至多为2的路。 证明了若G是4-圈不共点的平面图,则la2(G)≤「Δ/2+5。

关 键 词:平面图    线性2-荫度  
收稿时间:2016-12-16

Linear 2-arboricity of planar graphs with 4-cycles have no common vertex
CHEN Hong-yu,ZHANG Li. Linear 2-arboricity of planar graphs with 4-cycles have no common vertex[J]. Journal of Shandong University, 2017, 52(12): 36-41. DOI: 10.6040/j.issn.1671-9352.0.2016.597
Authors:CHEN Hong-yu  ZHANG Li
Affiliation:1. School of Science, Shanghai Institute of Technology, Shanghai 201418, China;2. School of Statistics and Mathematics, Shanghai Lixin University of Accouting and Finance, Shanghai 201209, China
Abstract:The linear 2-arboricity la2(G)of G is the least integer k to divide G into k edge-disjoint forests, and each branch of the forests is a path with the length at most 2. We prove that if G is a planar graph with 4-cycles without common vertex, then la2(G)≤「Δ/2+5.
Keywords:cycle  planar graph  linear 2-arboricity  
本文献已被 CNKI 等数据库收录!
点击此处可从《山东大学学报(理学版)》浏览原始摘要信息
点击此处可从《山东大学学报(理学版)》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号