文章详细信息 关键词： 平面图;;圈;;距离;;3-可着色 [gap=282]Keywords: planar graphs;cycles;distance;3-colorable
基于28个网页-相关网页
K6-MINORS IN PROJECTIVE PLANAR GRAPHS 投影平面图的K
1-planar graphs 平面图
cubic planar graphs 三次平面图
connected planar graphs 平面连通图
particular planar graphs 特殊平面图
Definitions of Planar Graphs 平面图的定义
The area of planar graphs 平面图形的面积
Another Characterization for Planar Graphs 平面图的另一种特征化
Edge Coloring of Planar Graphs 平面图的边染色
By 16, 36, the induced matching fc-partition problem is NP-complete, and also NP-complete for k = 2 and for 3-regular planar graphs, respectively.
文16，36证明了图的导出匹配k-划分问题是NP-完全的，即使是对k=2和3-正则平面图这两种特殊情形也是NP-完全的。
参考来源 - 图的广义着色·2,447,543篇论文数据，部分数据来源于NoteExpress
Computing the area of a planar graphs is valuable in engineering.
平面图形面积的计算具有较高的工程价值。
In this paper, we give some group chromatic of simple planar graphs.
在本文中，我们给出了一些简单平面图的群染色数。
It is known that the problem is APX-hard for general graphs and NP-hard for planar graphs.
此问题在一般图下是APX困难问题，在平面图下是NP困难问题。
应用推荐