Adjacent vertex distinguishing total coloring of Cartesian product graphs

被引：0
|
作者：
Course Department, Common Course Department, Anhui Xinhua University, Hefei, China [1 ]
机构：
来源：
Future Mechatronics Automation Proc. Intl. Conf. Future. Mechatronics Automation | / 191-194期
关键词：
Compilation and indexing terms; Copyright 2025 Elsevier Inc;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
Graph theory
引用
收藏
相关论文
共 8 条
  • [1] Adjacent Vertex Distinguishing Total Coloring of Corona Product of Graphs
    Furmańczyk, Hanna
    Zuazua, Rita
    arXiv, 2022,
  • [2] Incidence adjacent vertex-distinguishing total coloring of graphs
    Institute of Applied Mathematics, Lanzhou Jiaotong University, Lanzhou 730070, China
    不详
    Proc. - Int. Conf. Comput. Intell. Softw. Eng., CiSE, 1600,
  • [3] Adjacent Vertex Reducible Total Coloring Algorithm for Several Joint Graphs
    Yang, Wenzhu
    Li, Jingwen
    ITOEC 2023 - IEEE 7th Information Technology and Mechatronics Engineering Conference, 2023, : 620 - 624
  • [4] Neighbor sum distinguishing total coloring of sparse IC-planar graphs
    Song, Wen-yao
    Miao, Lian-ying
    Li, Jin-bo
    Zhao, Yue-ying
    Pang, Jing-ru
    Discrete Applied Mathematics, 2019, 239 : 183 - 192
  • [5] New Results on Edge-Coloring and Total-Coloring of Split Graphs
    da Costa, Diego Amaro Ferraz
    Couto, Fernanda
    Klein, Sulamita
    SSRN,
  • [6] The total coloring of K5-minor-free graphs
    Yang, Fan
    Wu, Jianliang
    arXiv, 2021,
  • [7] Total domination changing and stable graphs upon vertex removal
    Department of Mathematics, East Tennessee State University, Johnson City, TN 37614-0002, United States
    不详
    Discrete Appl Math, 15 (1548-1554):
  • [8] The K-(2,1)-Total Choosability of 1-Planar Graphs without Adjacent Short Cycles
    Song, Yan
    Sun, Lei
    IAENG International Journal of Applied Mathematics, 2022, 52 (02):
1