A note on the minimum number of choosability of planar graphs
The problem of minimum number of choosability of graphs was first introduced.by Vizing. It appears in some practical problems when concerning frequency.assignment. In this paper, we study two important list coloring, list edge coloring and.list total coloring. We prove that χl (G) = Δ and χl (G) = Δ
用户评论
相关推荐
Group Chromatic Number of several Planar Graphs
几类平面图的群色数，杨星星，孙庆波，本文主要是在分析了图的特性的基础上讨论了它们的群色数。对于单圈图、双圈图我们可得出其群色数都是3，还证明了Pseudo-Halin图的群�
PDF
86KB
2020-07-20 01:26
Feedback Number of Hanoi Graphs
汉诺图的反馈点数,王海亮,杨超,汉诺图是由汉诺塔问题转化而来的一类图。在汉诺塔问题中,将盘子分布在杆子上的一种状态当成图中的一个点,如果状态x能通过一步�
PDF
78KB
2020-09-11 15:13
On the linear arboricity of1planar graphs
1-平面图的线性荫度，张欣，刘桂真，如果一个图可以画在平面上使得其中的每条边被其他边交叉最多一次,则称该图是1-平面图。如果一个森林的每个分支都是路,则称该森林�
PDF
138KB
2020-07-16 15:09
On the antiKelul e number of cubic graphs
三正则图的反凯库勒数，李秋丽，邵慰慈，一个连通图的反凯库勒数为去掉的最少的边数使得剩下的图依然连通但是没有完美匹配。这篇文章证明了三正则图的反凯库勒数为3或者
PDF
0B
2020-05-23 13:13
On Sparse Maximal2Planar Graphs.pdf
图论资料,仅供学习使用,方便自己平时学习资料查阅,日常讲义积累,请勿用作商业用途,On Sparse Maximal 2-Planar Graphs
PDF
169KB
2020-09-24 03:21
Total coloring of planar graphs without adjacent short cycles
Total coloring of planar graphs without adjacent short cycles
PDF
371KB
2021-02-09 19:26
The minimal spectral radius of graphs with a given independence number
独立数固定下的最小谱半径,徐咪咪,束金龙,图$G$ 中两两不邻接的点集称为独立集.独立数$alpha(G)$ 定义为最大独立集中顶点的个数.本文主要刻画了在独立数$alpha in{1,2,lceil
PDF
266KB
2020-08-10 16:44
On the domination number of generalized Petersen graphs P ckk
On the domination number of generalized Petersen graphs P(ck,k)
PDF
665KB
2021-02-21 03:37
Adjacent Vertex Distinguishing Proper Edge Colorings of Planar Bipartite Graphs
Adjacent-Vertex-Distinguishing Proper Edge Colorings of Planar Bipartite Graphs with △=9, 10, 11
PDF
305KB
2021-02-09 19:26
Planar quintic G2Hermite interpolation with minimum strain energy
Planar quintic G2 Hermite interpolation with minimum strain energy
PDF
832KB
2021-02-23 11:00
LABELING PLANAR GRAPHS WITHOUT45CYCLES WITH A CONDITION ON DISTANCE TWO
LABELING PLANAR GRAPHS WITHOUT 4,5-CYCLES WITH A CONDITION ON DISTANCE TWO
PDF
590KB
2021-02-18 03:10
List edge and list total coloring of planar graphs with maximum degree8
Let G be a planar graph with maximum degree Δ ≥ 8 and without chordal.5-cycles. Then χ l (G) = Δ and
PDF
344KB
2021-02-09 19:26
Dijkstra_A note on Two Problems in Connexion with Graphs.pdf
We consider n points (nodes), some or all pairs of which are connected by a branch; the length of ea
PDF
136KB
2020-07-21 18:27
Minimum realization
Minimum realization是最小化实现，希望对大家有用。
RAR
0B
2018-12-29 21:05
Graphs TheoryandAlgorithms
Finallywethankourwives—SanthaThulasiramanandLeelaSwamy—andourchildrenfortheirpatienceandunderstandin
pdf
0B
2019-07-13 04:18