典型文献
List Injective Coloring of Planar Graphs
文献摘要：
A k-coloring of a graph G is a mapping c:V(G)→{1,2,…,k}.The coloring c is called injective if any two vertices have a common neighbor get distinct colors.A graph G is injectively k-choosable if for any color list L of admissible colors on V(G)of size k allows an injective coloringφ such thatφ(v)∈ L(v)for each v ∈ V(G).Let Xi(G),xli(G)denote the injective chromatic number and injective choosability number of G,respectively.In this paper,we show that xli(G)≤Δ+4 if Δ≥22 andxli(G)≤Δ+5 if Δ≥15,where G is a triangle-free planar graph and without intersecting 4-cycles.
文献关键词：
中图分类号：
作者姓名：
Wen-wen LI;Jian-sheng CAI;Gui-ying YAN
作者机构：
School of Mathematics and Statistics,Shandong Normal University,Jinan,250358,China;School of Mathematics and Information Sciences,Weifang University,Weifang 261061,China;Academy of Mathematics and System Sciences,Chinese Academy of Sciences,Beijing 100190,China
文献出处：
引用格式：
[1]Wen-wen LI;Jian-sheng CAI;Gui-ying YAN-.List Injective Coloring of Planar Graphs)[J].应用数学学报（英文版）,2022(03):614-626
A类：
injectively,choosable,xli,choosability,andxli
B类：
List,Injective,Coloring,Planar,Graphs,coloring,graph,mapping,called,if,any,two,vertices,have,common,neighbor,get,distinct,colors,list,admissible,size,allows,such,that,each,Let,Xi,denote,chromatic,number,respectively,this,paper,we,show,+4,+5,where,triangle,free,planar,without,intersecting,cycles
AB值：
0.546952
相似文献
机标中图分类号，由域田数据科技根据网络公开资料自动分析生成，仅供学习研究参考。
