VERTICES

作品数：83被引量：56H指数：5
导出分析报告
相关领域：理学更多>>
相关作者：袁夫永陈明珠欧阳晨周本达陈明华更多>>
相关机构：华南师范大学广西职业技术学院皖西学院南京师范大学更多>>
相关期刊：更多>>
相关基金：国家自然科学基金福建省自然科学基金上海市教育委员会重点学科基金国家重点实验室开放基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
选择条件：
  • 期刊=Acta Mathematicae Applicatae Sinicax
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
1-planar Graphs without 4-cycles or 5-cycles are 5-colorable
《Acta Mathematicae Applicatae Sinica》2022年第1期169-177,共9页Li-li 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 graph is 1-planar if it can be drawn on the Euclidean plane so that each edge is crossed by at most one other edge.A proper vertex k-coloring of a graph G is defined as a vertex coloring from a set of k colors such ...
关键词：1-planar colorable DISCHARGING VERTICES FACES 
On a Spanning K-tree Containing Specified Vertices in a Graph
《Acta Mathematicae Applicatae Sinica》2019年第4期919-923,共5页Fei-fei SONG Zhi-quan HU 
Partially supported by National Natural Science Foundation of China(No.11771172);key scientific and technological project of higher education of Henan Province(No.19A110019);Science and technology innovation fund of Henan Agricultural University(No.KJCX2019A15);Partially supported by the Ph D Research Foundation of Henan Agricultural University(No.30500614)
A k-tree is a tree with maximum degree at most k. In this paper, we give a sharp degree sum condition for a graph to have a spanning k-tree in which specified vertices have degree less than t, where 1≤t≤k.We denote ...
关键词：SPANNING tree K-TREE (s + 1)-connected GRAPHS degree SUM condition specified VERTICES 
Decomposition of λK_v into Five Graphs with Six Vertices and Eight Edges被引量：1
《Acta Mathematicae Applicatae Sinica》2012年第4期823-832,共10页Lan-dang YUAN Qing-de KANG 
Supported by National Natural Science Foundation of China Grant 10971051,11171089;Natural Science Foundation of Hebei Province Grant A2010000353
In this paper, we discuss the G-decomposition of λKv （G-GD）, （v）） into five graphs with six vertices and eight edges. We present some recursive structures and a number of G-designs of small orders, holey G- desi...
关键词：graph design holey graph design quasi-group 
Graph Designs for all Graphs with Six Vertices and Eight Edges被引量：5
《Acta Mathematicae Applicatae Sinica》2005年第3期469-484,共16页Qing-de Kang Lan-dang Yuan Shu-xia Liu 
Supported by the Natural Science Foundation of China （No.10371031） and Natural Science Foundation of Hebei （No.103146）.
Graph designs for all graphs with six vertices and eight edges are discussed. The existence of these graph designs are completely solved except in two possible cases of order 32.
关键词：Graph design holey graph design quasi-group 
Distance Between Two Vertices of Maximum Matching Graphs
《Acta Mathematicae Applicatae Sinica》2004年第4期641-646,共6页YanLiu 
The maximum matching graph of a graph has a vertex for each maximum matching and an edge for each pair of maximum matchings which differ by exactly one edge. In this paper, we obtain a lower bound of distance between ...
关键词：Maximum matching graph DISTANCE positive surplus 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部