On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

LinSun; JianliangWu

首页> 外文期刊>Hormone molecular biology and clinical investigation. >On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

【24h】

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

机译：的边缘色素1-Planar图没有5-Cycles两个和弦

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

A graph is 1-planar if it can be drawn on the plane so that each edge is crossed by at most one other edge. In this paper, it is proved that every 1-planar graph with maximum degree ? ≥ 8 is edge-colorable with ? colors if each of its 5-cycles contains at most one chord.

机译：图是1-planar如果可以画在飞机,每条边被一个交叉其他优势。每个1-planar图以最大程度?edge-colorable ?5-cycles最多包含一个和弦。

著录项

来源
《Hormone molecular biology and clinical investigation.》 |2019年第2期|301-312|共12页
作者
LinSun; JianliangWu;
展开▼
作者单位

School of Mathematics and Statistics, Lingnan Normal University Zhanjiang, 524000, China.;

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类
关键词
discharging way; planning drawings; Edge of a figure or solidcolored graph;

机译：放电方式;规划图纸;边缘人物或solidcolored图;

相似文献

外文文献
中文文献

1. Antipodal Edge-Colorings of Hypercubes [J] . Douglas B.West, Jennifer I.Wise Hormone molecular biology and clinical investigation. . 2019,第1期

机译：映Edge-Colorings超立方体的
2. List-edge-coloring of planar graphs without 6-cycles with three chords [J] . Wang Haiying, Wu Jianliang Journal of combinatorial optimization . 2018,第2期

机译：Last-Edge-Coloring的平面图没有6个循环，三个和弦
3. Chapter 11 Gravitational Swarm Approach for Graph Coloring [C] . Israel Rebollo Ruiz, Manuel Grana Romay International workshop on nature inspired cooperative strategies for optimization . 2011

机译：第11章Graph Coloring的引力群方法
4. Towards generic region segmentation for image/video analysis: An integrated perceptual grouping approach using Generic-Edge-Token-graph. [D] . Chen, HuiQiong. 2009

机译：走向用于图像/视频分析的通用区域分割：使用Generic-Edge-Token-graph的集成感知分组方法。
5. b-Coloring is NP-hard on Co-bipartite Graphs and Polytime Solvable on Tree-Cographs [O] . Bonomo, Flavia, Schaudt, Oliver, Stein, Maya, 2015

机译：b-Coloring在Co-bipartite Graphs上是Np-hard，在Tree-Cographs上是polytime可解决的

On Edge Colorings of 1-Planar Graphs without 5-Cycles with Two Chords

摘要

著录项

相似文献

相关主题

期刊订阅