The server is under maintenance between 08:00 to 12:00 (GMT+08:00), and please visit later.
We apologize for any inconvenience caused
Login  | Sign Up  |  Oriprobe Inc. Feed
China/Asia On Demand
Journal Articles
Laws/Policies/Regulations
Companies/Products
Bookmark and Share
The Linear 2-Arboricity of K4-minor-free Graphs
Author(s): 
Pages: 48-54
Year: Issue:  4
Journal: Operations Research Transactions

Keyword:  运筹学图论K4-minor-free图线性2-荫度;
Abstract: 图G的线性2-荫度la2(G)是将G分解为k个边不交的森林的最小整数k,其中每个森林的分支树是长度至多为2的路.本文证明了若G是最大度为A(G)的K4-minor-free图,则la2(a)≤△(G)+5/2.
Related Articles
No related articles found