Adjacent Vertex Reducible Edge Coloring for graphs

被引：0
|
作者：
Ding, Zhe [1 ]
Li, Jingwen [1 ]
Luo, Rong [1 ]
Zhang, Lijing [2 ]
机构：
[1] College of Electronics and Information Engineering, Lanzhou Jiaotong University, Lanzhou, China
[2] College of Information Processing and Control Engineering, Lanzhou Petrochemical Technical University, Lanzhou, China
来源：
IEEE Joint International Information Technology and Artificial Intelligence Conference (ITAIC) | 2022年 / 2022-June卷
关键词：
Compendex;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Iterative methods
引用
收藏
页码：1049 / 1053
相关论文
共 32 条
  • [21] A matrix method for computing Szeged and vertex PI indices of join and composition of graphs
    School of Mathematics, Statistics and Computer Science, University of Tehran, Tehran, Iran
    不详
    Linear Algebra Its Appl, 1600, 11-12 (2702-2709):
  • [22] Finding maximum edge bicliques in convex bipartite graphs
    Nussbaum, Doron
    Pu, Shuye
    Sack, Jörg-Rüdiger
    Uno, Takeaki
    Zarrabi-Zadeh, Hamid
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2010, 6196 LNCS : 140 - 149
  • [23] AN ALGORITHMIC APPROACH TO ANTIMAGIC LABELING OF EDGE CORONA GRAPHS
    Nivedha, D.
    Yamini, S. Devi
    arXiv, 2022,
  • [24] Edge sparsification for graphs via meta-learning
    Wan, Guihong
    Schweitzer, Haim
    Proceedings - International Conference on Data Engineering, 2021, 2021-April : 2733 - 2738
  • [25] Exploration of k-edge-deficient temporal graphs
    Erlebach, Thomas
    Spooner, Jakob T.
    ACTA INFORMATICA, 2022, 59 (04) : 387 - 407
  • [26] UNAVOIDABLE IMMERSIONS OF 4− AND f(t)−EDGE-CONNECTED GRAPHS
    Ding, Guoli
    Qualls, Brittian
    arXiv,
  • [27] Laplacian state transfer on graphs with an edge perturbation between twin vertices
    Pal, Hiranmoy
    arXiv, 2021,
  • [28] On super 3-restricted edge connectivity of direct product graphs
    Department of Applied Mathematics, Wuyi University, Jiangmen, 529020, China
    Int. J. Appl. Math. Stat., 1600, D10 (97-104):
  • [29] Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
    College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Zhejiang Jinhua, 321004, China
    Discrete Appl Math, 1600, 13 (2778-2784):
  • [30] Acyclic edge colourings of graphs with the number of edges linearly bounded by the number of vertices
    Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Z. Szafrana 4a, 65-516 Zielona Góra, Poland
    Inf. Process. Lett., 6 (287-290):
1234