The L(2,1)-Labeling of Planar Graphs with Neither 3-Cycles Nor Intersect 4-Cycles

被引:0
|
作者
Zhou, Wenjuan [1 ]
Sun, Lei [1 ]
机构
[1] School of Mathematics and Statistics, Shandong Normal University, Jinan, China
来源
Journal of Physics: Conference Series | 2021年 / 1769卷 / 01期
关键词
921.4 Combinatorial Mathematics; Includes Graph Theory; Set Theory;
D O I
暂无
中图分类号
学科分类号
摘要
Graphic methods
引用
收藏
相关论文
共 50 条
  • [21] Every planar graph without 3-cycles adjacent to 4-cycles and without 6-cycles is (1,1,0)-colorable
    Bai, Ying
    Li, Xiangwen
    Yu, Gexin
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2017, 33 (04) : 1354 - 1364
  • [22] FLEXIBILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Masarik, T.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 935 - 940
  • [23] The L(p, q)-labelling of planar graphs without 4-cycles
    Zhu, Haiyang
    Hou, Lifeng
    Chen, Wei
    Lu, Xinzhong
    DISCRETE APPLIED MATHEMATICS, 2014, 162 : 355 - 363
  • [24] The (3,3)-colorability of planar graphs without 4-cycles and 5-cycles
    Liu, Yuhao
    Xiao, Mingyu
    DISCRETE MATHEMATICS, 2023, 346 (04)
  • [25] Equitable Δ-Coloring of Planar Graphs without 4-cycles
    Tan, Xiang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 400 - 405
  • [26] Planar graphs with distance of 3-cycles at least 2 and no cycles of lengths 5, 6, 7
    Wang, Tao
    Wang, Ya-Nan
    Yang, Xiaojing
    APPLIED MATHEMATICS AND COMPUTATION, 2024, 481
  • [27] Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles
    Lo, On-Hei Solomon
    JOURNAL OF GRAPH THEORY, 2024, 107 (04) : 702 - 728
  • [28] LIGHT 3-CYCLES IN 1-PLANAR GRAPHS WITH DEGREE RESTRICTIONS
    Zhang, Xin
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2014, 51 (02) : 511 - 517
  • [29] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [30] Linear Coloring of Planar Graphs Without 4-Cycles
    Wang, Weifan
    Wang, Yiqiao
    GRAPHS AND COMBINATORICS, 2013, 29 (04) : 1113 - 1124