ARBORICITY

作品数：5被引量：2H指数：1
导出分析报告
相关领域：理学更多>>
相关期刊：《Journal of Donghua University(English Edition)》《Acta Mathematicae Applicatae Sinica》更多>>
相关基金：国家自然科学基金更多>>
-
在结果中检索

检索结果分析

结果分析中...
共 条 记 录，以下是1-5
全选清除导出
参考文献引证文献引用追踪
视图：
排序：
List Vertex-arboricity of Planar Graphs without Intersecting 5-cycles被引量：1
《Acta Mathematicae Applicatae Sinica》2020年第2期439-447,共9页Wei-fan WANG Li HUANG Min CHEN 
supported by the National Natural Science Foundation of China(Nos.11971437,11771402);the Natural Science Foundation of Zhejiang Province(No.LY19A010015).
The vertex-arboricity a(G)of a graph G is the minimum number of colors required for a vertex coloring of G such that no cycle is monochromatic.The list vertex-arboricity al(G)is the list-coloring version of this conce...
关键词：planar GRAPHS LIST vertex-arboricity intersecting cycles MONOCHROMATIC CYCLE 
Linear Arboricity of NIC-Planar Graphs被引量：1
《Acta Mathematicae Applicatae Sinica》2019年第4期924-934,共11页Bei NIU Xin ZHANG 
Supported by the National Natural Science Foundation of China(Nos.11871055,11301410);the Natural Science Basic Research Plan in Shaanxi Province of China(No.2017JM1010);the Fundamental Research Funds for the Central Universities(Nos.JB170706)
A graph is NIC-planar if it admits a drawing in the plane with at most one crossing per edge and such that two pairs of crossing edges share at most one common end vertex. It is proved that every NIC-planar graph with...
关键词：NIC-planar GRAPH LINEAR ARBORICITY LIGHT EDGE 
On k-Star Arboricity of Graphs
《Journal of Donghua University(English Edition)》2014年第3期335-338,共4页陶昉昀 林文松 
National Natural Science Foundation of China(No.10971025)
A star forest is a forest whose components are stars. The star arboricity of a graph G,denoted by sa（ G）,is the minimum number of star forests needed to decompose G. Let k be a positive integer. A k-star forest is a...
关键词：star arboricity k-star arboricity linear k-arboricity cubic graphs subcubic graphs 
PARTITIONING CIRCULANT GRAPHS INTOISOMORPHIC LINEAR FORESTS
《Acta Mathematicae Applicatae Sinica》1999年第3期321-325,共5页扈文峰 王建方 
It is a well known fact that the linear arboricity of a k-regular graph is [(k+1)/2] fork=3,4. In this paper, we prove that if the number Of edges of a k-regular circulant is divisibleby [(k+1)/2], then its edge set c...
关键词：ARBORICITY CIRCULANT linear forests 
ARBORICITY AND COMPLEMENT OF A GRAPH
《Acta Mathematicae Applicatae Sinica》1998年第1期28-35,共8页王建方 陈传平 张忠辅 
The arboricity of graph G=(V,E), denoted by a(G), is defined as a(G)=min{n | E can be partitioned into n subsets E1,E2,...,En, such that each subset spans a subgraph of G so as to be a forest}.In this paper the follow...
关键词：ARBORICITY COMPLEMENT vertex-arboricity 
全选清除导出
共1页<1>
检索报告 对象比较 聚类工具 使用帮助 返回顶部