| |
Klein瓶上达到最大因子临界度的图的刻画（英文）
|
 |
- 英文篇名：The characterization of extremal factor-critical graphs on the Klein bottle
- 作者：李秋丽
- 英文作者：Li Qiu-li;School of Mathematics and Statistics, Lanzhou University;
- 关键词：匹配 ; p-因子临界 ; Klein瓶上的图
- 英文关键词：matching;;p-factor-critical;;graph on the Klein bottle
- 中文刊名：LDZK
- 英文刊名：Journal of Lanzhou University(Natural Sciences)
- 机构：兰州大学数学与统计学院;
- 出版日期：2017-04-15
- 出版单位：兰州大学学报(自然科学版)
- 年：2017
- 期：v.53;No.230
- 基金：Supported by Natural Science Foundation of China(11401279);;
the Specialized Research Fund for the Doctoral Program of Higher Education(20130211120008);;
the Fundamental Research Funds for the Central Universities(LZUJBKY-2016-102)
- 语种：英文;
- 页：LDZK201702014
- 页数：4
- CN：02
- ISSN：62-1075/N
- 分类号：103-105+110
|
摘要
若从一个阶数为n的图中任意删除p(p 因子临界图.
A graph of order n is said to be p-factor-critical for non-negative integer p
引文
[1]Ananchuen N,Caccetta L,Ananchuen W.A characterization of maximal non-k-factor-critical graphs[J].Discrete Mathematics,2007,307(1):108-114.
[2]Favaron O.Equimatchable factor-critical graphs[J].Journal of Graph Theory,1986,10(4):439-448.
[3]Favaron O.Extendability and factor-criticality[J].Discrete Mathematics,2000,213(1/3):115-122.
[4]Liu Gui-zhen,Yu Qing-lin.Generalizations of matching extension in graphs[J].Discrete Mathematics,2001,231(1/3):311-320.
[5]Lou Ding-jun,Rao Dong-ning.Characterizing factor critical graphs and its algorithm[J].Australasian Journal of Combinatorics,2004,30:51-56.
[6]Laszl L,Plummer M D.Matching theory[M]//Annals of discrete mathematics,Amsterdam:North Holland Publishing Co,1986.
[7]Yu Qing-lin,Liu Gui-zhen.Graph factors and matching extensions[M].Berlin:Springer-Verlag,2009.
[8]Su Hong-yuan,Zhang He-ping.The factor-criticality of surfaces[D].Lanzhou:School of Mathematics and Statistics,Lanzhou University,2001.(In Chinese)
[9]Plummer M D,Zha X.On the p-factor-criticality of the Klein bottle[J].Discrete Mathematics,2004,287(1):171-175.
[10]Lu Hong-liang,Wang D G L.Surface embedding of(n,k)-extendable graphs[J].Discrete Applied Mathematics,2014,179(3):163-173.
[11]Fijavz G.Minor-minimal 6-regular graphs in the Klein bottle[J].European Journal of Combinatorics,2004,25(6):893-898.
[12]Li Qiu-li,Zhang He-ping.On the restricted matching extension of graphs on the torus and the Klein bottle[J].Discrete Mathematics,2012,312(16):2450-2456.
[13]Nakamoto A,Sasanuma N.Chromatic numbers of 6-regular graphs on the Klein bottle[J].Australisian Journal of Combinatorics,2009,45:73-85.
[14]Negami S.Uniqueness and faithfulness of embedding of graphs into surfaces[D].Tokyo:Tokyo Institute of Technology,1985.
[15]Thomassen C.Tilings of the torus and the Klein bottle and vertex-transitive graphs on a fixed surfaces[J].Transactions of the American Mathematical Society,1991,323(2):605-635.
[16]Li Qiu-li,Zhang He-ping.5-factor-critical graphs on the torus[J].Ars Combinatoria,2014,115:357-366.
[17]Favaron O.On k-factor-critical graphs[J].Discussiones Mathematicae-Graph Theory,1995,16(1):41-51.
[18]Negami S,Suzuki Y.The 2-extendability of 5-connected graphs on the Klein bottle[J].Discrete Mathematics,2010,310(19):2510-2518.
[19]Diestel R.Graph theroy[M].New York:Springer-Verlag,2006.
| |
NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.
| |
