line critical graph 线临界图
point-critical graph 点临界图
critical-graph 临界图
a critical graph 临界图
V-critical graph 顶点临界图
k-critical graph k临界图
edge critical graph 边临界图
Corollary 2. 1. 2 Every fractional colour-critical graph is 2-connected.
推论2.1.2每个分数染色临界图是2连通的。
参考来源 - 图的分数染色An algorithm for constructing the critical graph not containing Cm and an algorithm for coloring the edges of a graph with two colors are given in this dissertation.
本文研制了构造不含圈Cm的临界图算法和对一个图的所有边进行两着色的算法。
参考来源 - 若干图的Ramsey数研究·2,447,543篇论文数据,部分数据来源于NoteExpress
以上来源于: WordNet
应用推荐