【摘 要】
：
A perfect matching cover of a graph G is a set of perfect matchings of G such that each edge of G is contained in at least one member of it.Berge conjecture
【机 构】
：
FuzhouUniversity,Fuzhou350116,P.R.China
【出 处】
：
第六届图论与组合算法国际研讨会(The 6th International Symposium on Graph The
论文部分内容阅读
A perfect matching cover of a graph G is a set of perfect matchings of G such that each edge of G is contained in at least one member of it.Berge conjectured every bridgeless cubic graphs has a perfect matching cover of order at most 5.
其他文献
A tree is called double starlike if it has exactly two vertices of degree greater than two.Let H(p,n,q)denote the double starlike tree obtained by attaching
Let G be a graph,B(G),Bc(G),BS(G),BSc(G)and C(G)be the band-width,cyclic bandwidth,bandwidth sum,cyclic bandwidth sum and cutwidth of G,respectively.
An r-acyclic edge coloring of a graph G is a proper edge coloring such that any cycle C has at least min{|C|,r} colors.The least number of colors needed for
The genus distribution of a graph G is defined to be the sequence {gm},where gm is the number of di erent embeddings of G in the closed orientable surface o
Treewidth is a graph parameter of fundamental importance in graph minor theory,with numerous applications in algorithmic theory and practical computing.In t
Corrádi and Hajnal[On the maximal number of independent circuits in a graph,Acta Math.Acad.Sci.Hungar.14(1963),423-439] investigated the maximum number of
Let G be a graph and λ1≥λ2≥…≥λn the eigenvalues of G.The energy E(G)of G is defined as ∑nk=1|λk|.A well-known result on the energy of graphs is the
This presentation research some new special combination sequence.We give a probabilistic proof of generalized harmonic numbers H(r)n,and obtain the probabil
The convolution array is a matrix whose nth column is the n-fold convolution for the 0th column.In this talk,we evaluate two truncated determinants of convo
阐述(V,R)-语言、(V,R)-半群、拟简单图以及拟严格有向图等概念,建立(V,R)-语言、(V,R)-半群、互联网络与拟简单图、拟严格有向图以及随机图的关系,进而,以上领域互为工