Strongly light subgraphs in the 1-planar graphs with minimum degree 7

被引：3
|
作者：
Wang, Tao [1 ,2 ]
机构：
[1] Henan Univ, Inst Appl Math, Kaifeng 475004, Peoples R China
[2] Henan Univ, Sch Math & Stat, Kaifeng 475004, Peoples R China
来源：
ARS MATHEMATICA CONTEMPORANEA | 2015年 / 8卷 / 02期
关键词：
Strongly light subgraph; 1-planar graph; EDGE COLORINGS;
D O I：
10.26493/1855-3974.564.d96
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is 1-planar if it can be drawn in the plane such that every edge crosses at most one other edge. A connected graph H is strongly light in a family of graphs G, if there exists a constant lambda, such that every graph G in G contains a subgraph K isomorphic to H with deg(G)(v) <= lambda for all v is an element of V(K). In this paper, we present some strongly light subgraphs in the family of 1-planar graphs with minimum degree 7.
引用
收藏
页码：409 / 416
页数：8
相关论文
共 13 条
  • [1] Light subgraphs in the family of 1-planar graphs with high minimum degree
    Zhang, Xin
    Liu, Gui Zhen
    Wu, Jian Liang
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2012, 28 (06) : 1155 - 1168
  • [2] LIGHT 3-CYCLES IN 1-PLANAR GRAPHS WITH DEGREE RESTRICTIONS
    Zhang, Xin
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2014, 51 (02) : 511 - 517
  • [3] On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree
    Zhang, Xin
    Liu, Guizhen
    ARS MATHEMATICA CONTEMPORANEA, 2014, 7 (02) : 281 - 291
  • [4] On total colorings of 1-planar graphs
    Zhang, Xin
    Hou, Jianfeng
    Liu, Guizhen
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2015, 30 (01) : 160 - 173
  • [5] A note on total colorings of 1-planar graphs
    Czap, Julius
    INFORMATION PROCESSING LETTERS, 2013, 113 (14-16) : 516 - 517
  • [6] NOTE ON IMPROPER COLORING OF 1-PLANAR GRAPHS
    Chu, Yanan
    Sun, Lei
    Yue, Jun
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2019, 69 (04) : 955 - 968
  • [7] On (p, 1)-total labelling of special 1-planar graphs
    Sun, Lin
    Cai, Hua
    ARS COMBINATORIA, 2015, 123 : 87 - 96
  • [8] Some sufficient conditions for 1-planar graphs to be Class 1
    Zhang, Wenwen
    Wu, Jian-Liang
    THEORETICAL COMPUTER SCIENCE, 2015, 566 : 50 - 58
  • [9] ON THE MINIMUM WEIGHT OF A 3-CONNECTED 1-PLANAR GRAPH
    Lu, Zai Ping
    Song, Ning
    BULLETIN OF THE KOREAN MATHEMATICAL SOCIETY, 2017, 54 (03) : 763 - 787
  • [10] Fractional coloring problem of 1-planar graphs without short cycles
    Li, Meng Jiao
    Sun, Lei
    Zheng, Wei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (08)
12