CHOOSABILITY

作品数：18被引量：16H指数：2
导出分析报告
相关领域：理学自动化与计算机技术更多>>
相关作者：刘桂真禹继国何文杰王光辉郑国萍更多>>
相关机构：河北科技师范学院曲阜师范大学河北工业大学山东大学更多>>
相关期刊：《Frontiers of Mathematics in China》《Acta Mathematica Sinica,English Series》《Journal of Mathematical Research with Applications》《Science China Mathematics》更多>>
相关基金：国家自然科学基金福建省自然科学基金山东省自然科学基金广东省自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-10
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
List Edge Colorings of Planar Graphs without Non-induced 7-cycles
《Acta Mathematica Sinica,English Series》2025年第3期1037-1054,共18页Li Zhang Hajo Broersma You Lu Shenggui Zhang 
Supported by NSFC(Grant Nos.12271438,12071370 and U1803263);China Scholarship Council(Grant No.202006290386)。
A graph G is edge-k-choosable if,for any assignment of lists L(e)of at least k colors to all edges e∈E(G),there exists a proper edge coloring such that the color of e belongs to L(e)for all e∈E(G).One of Vizing’s c...
关键词：Planar graph list edge coloring edge-k-choosability Combinatorial Nullstellensatz DISCHARGING 
(3, 1)^(*)-choosability of plane graphs without adjacent single cycles
《Frontiers of Mathematics in China》2024年第2期101-115,共15页Jufeng ZHANG Min CHEN Yiqiao WANG 
Given a list assignment of L to graph G,assign a list L(υ)of colors to each υ∈V(G).An(L,d)^(*)-coloring is a mapping π that assigns a color π(υ)∈L(υ)to each vertex υ∈V(G)such that at most d neighbors of υ r...
关键词：Plane graph improper list coloring (k d)^(*)-choosable CYCLE 
Neighbor Sum Distinguishing Total Choosability of Planar Graphs with Maximum Degree at Least 10被引量：1
《Acta Mathematicae Applicatae Sinica》2024年第1期211-224,共14页Dong-han Zhang You Lu Sheng-gui Zhang Li Zhang 
supported by the National Natural Science Foundation of China (No.12271438, No.12071370 and U1803263);the Science Found of Qinhai Province (No.2022-ZJ-753);Shaanxi Fundamental Science Research Project for Mathematics and Physics (No.22JSZ009);Shangluo University Doctoral Initiation Fund Project(No.22SKY112);Shangluo University Key Disciplines Project (Discipline name:Mathematics)。
A neighbor sum distinguishing(NSD)total coloringφof G is a proper total coloring of G such thatΣz∈EG(u)U{u}φ(z)≠Σz∈EG(v)U{v}φ(z)for each edge uv∈E(G),where EG(u)is the set of edges incident with a vertex u.In...
关键词：planar graphs neighbor sum distinguishing total choosibility combinatorial nullstellensatz discharging method 
Every Graph Embedded on the Surface with Euler Characteristic Numberε=-1 is Acyclically 11-choosable
《Acta Mathematica Sinica,English Series》2023年第11期2247-2258,共12页Lin SUN Guang Long YU Xin LI 
NSFC(Grant Nos.12101285,12171222);Basic and Applied Basic Research Foundation and Jointof Guangdong Province,China(Grant No.2019A1515110324);Guangdong Basic and Applied Basic Research Foundation(Natural Science Foundation of Guangdong Province,China,Grant No.2021A1515010254);Foundation of Lingnan Normal University(Grant Nos.ZL2021017,ZL1923)。
A proper vertex coloring of a graph G is acyclic if there is no bicolored cycles in G.A graph G is acyclically k-choosable if for any list assignment L={L(v):v∈V(G)}with|L(v)|≥k for each vertex v∈V(G),there exists ...
关键词：Acyclic coloring CHOOSABILITY graphs embedded on the surface Euler characteristic number 
A Result on K-(2,1)-Total Choosability of Planar Graphs
《Journal of Mathematical Research with Applications》2022年第2期121-128,共8页Yan SONG Lei SUN 
Supported by the National Natural Science Foundation of China(Grant No.12071265);the Natural Science Foundation of Shandong Province(Grant No.ZR2019MA032)。
A list assignment of a graph G is a function L:V(G)∪E(G)→2^(N).A graph G is L-(2,1)-Total labeling if there exists a function c such that c(x)∈L(x)for all x∈V(G)∪E(G),|c(u)-c(v)|≥1 if uv∈E(G),|c(e_(1))-c(e_(2))...
关键词：L-(2 1)-total labeling k-(2 1)-total choosable planar graphs 
Acyclic Choosability of Graphs with Bounded Degree
《Acta Mathematica Sinica,English Series》2022年第3期560-570,共11页Juan WANG Lian Ying MIAO Jin Bo LI Yun Long LIU 
Supported by National Natural Science Foundation of China(Grant Nos.11771443 and 11601510);Shandong Province Natural Science Foundation(Grant No.ZR2017QF011)。
An acyclic colouring of a graph G is a proper vertex colouring such that every cycle uses at least three colours. For a list assignment L = {L(v)| v∈V(G)}, if there exists an acyclic colouringρ such that ρ(v)∈L(v)...
关键词：Acyclic choosability list colouring acyclic colouring maximum degree 
Acyclic 6-choosability of Planar Graphs without 5-cycles and Adjacent 4-cycles
《Acta Mathematica Sinica,English Series》2021年第6期992-1004,共13页Lin SUN 
Supported by Guangdong Province Basic and Applied Basic Research Foundation and Joint Foundation Project(Grant No.2019A1515110324);Natural Science Foundation of Guangdong province(Grant No.2019A1515011031);University Characteristic Innovation Project of Guangdong province(Grant No.2019KTSCX092)。
A proper vertex coloring of a graph is acyclic if every cycle uses at least three colors.A graph G is acyclically k-choosable if for any list assignment L={L(v):v∈V(G)}with|L(v)|≥k for all v∈V(G),there exists a pro...
关键词：Planar graph acyclic coloring acyclic choosability 
Every Toroidal Graph Is Acyclically 8-Choosable被引量：3
《Acta Mathematica Sinica,English Series》2014年第2期343-352,共10页Jian Feng HOU Gui Zhen LIU 
supported by National Natural Science Foundation of China(Grant No.11001055);supported by National Natural Science Foundation of China(Grant No.60672030);Natural Science Foundation of Fujian Province(Grant Nos.2010J05004 and 2011J06001)
A proper coloring of a graphG is acyclic if G contains no 2-colored cycle.A graph G is acyclically L-list colorable if for a given list assignment L={L（v）：v∈V（G）},there exists a proper acyclic coloringφof G suc...
关键词：Acyclic coloring CHOOSABILITY toroidal graph 
Acyclic 6-choosability of planar graphs without adjacent short cycles被引量：2
《Science China Mathematics》2014年第1期197-209,共13页WANG WeiFan ZHANG Ge CHEN Min 
supported by National Natural Science Foundation of China (Grant Nos. 11071223 and 11101377);Natural Science Foundation of Zhejiang Province,China (Gran No. Z6090150);Zhejiang Innovation Project (Grant No. T200905);Zhejiang Normal University Innovation Team Program
A proper vertex coloring of a graph G is acyclic if G contains no bicolored cycles.Given a list assignment L={L(v)|v∈V}of G,we say that G is acyclically L-colorable if there exists a proper acyclic coloringπof G suc...
关键词：acyclic coloring acyclic choosability planar graph 05C15 
Group Edge Choosability of Planar Graphs without Adjacent Short Cycles被引量：1
《Acta Mathematica Sinica,English Series》2013年第11期2079-2086,共8页Xin ZHANG Gui Zhen LIU 
Supported by the Natural Science Basic Research Plan in Shaanxi Province of China(Grant No.2013JQ1002);the Fundamental Research Funds for the Central Universities(Grant No.K5051370003);National Natural Science Foundation of China(Grant Nos.11101243,11201440,11301410 and 61070230)
In this paper, we prove that 2-degenerate graphs and some planar graphs without adjacent short cycles are group （△ （G）＋1）-edge-choosable, and some planar graphs with large girth and maximum degree are group △（...
关键词：Group edge coloring list coloring planar graphs short cycles GIRTH 
全选清除导出
共2页<12>
检索报告 对象比较 聚类工具 使用帮助 返回顶部