A DEGREE CONDITION FOR THE CIRCUMFERENCE OF A GRAPH

被引：1
|
作者：
DEAN, N [1 ]
FRAISSE, P [1 ]
机构：
[1] ARCHET,F-92130 ISSY MOULINEAUX,FRANCE
来源：
JOURNAL OF GRAPH THEORY | 1989年 / 13卷 / 03期
关键词：
D O I：
10.1002/jgt.3190130308
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：331 / 334
页数：4
相关论文
共 50 条
  • [1] Minimum degree condition for a graph to be knitted
    Liu, Runrun
    Rolek, Martin
    Yu, Gexin
    DISCRETE MATHEMATICS, 2019, 342 (11) : 3225 - 3228
  • [2] A degree condition for a graph to have [a,b]-factors
    Li, YJ
    Cai, MC
    JOURNAL OF GRAPH THEORY, 1998, 27 (01) : 1 - 6
  • [3] Disjoint Cycles and Degree Sum Condition in a Graph
    Song, Chun-Jiao
    Wang, Yun
    Yan, Jin
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2024, 12 (04) : 1072 - 1087
  • [4] A Degree Condition for a Graph to Have [a, b]-Factors
    Institute of Systems Science, Chinese Academy of Sciences, Beijing, China
    J. Graph Theory, 1 (1-6):
  • [5] A MINIMUM DEGREE CONDITION FORCING COMPLETE GRAPH IMMERSION
    DeVos, Matt
    Dvorak, Zdenek
    Fox, Jacob
    McDonald, Jessica
    Mohar, Bojan
    Scheide, Diego
    COMBINATORICA, 2014, 34 (03) : 279 - 298
  • [6] A degree condition for a graph to have (a, b)-parity factors
    Liu, Haodong
    Lu, Hongliang
    DISCRETE MATHEMATICS, 2018, 341 (01) : 244 - 252
  • [7] A minimum degree condition forcing complete graph immersion
    Matt Devos
    Zdeněk Dvořák
    Jacob Fox
    Jessica McDonald
    Bojan Mohar
    Diego Scheide
    Combinatorica, 2014, 34 : 279 - 298
  • [8] A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph
    Kenta Ozeki
    Tomoki Yamashita
    Graphs and Combinatorics, 2008, 24 : 469 - 483
  • [9] A Degree Sum Condition Concerning the Connectivity and the Independence Number of a Graph
    Ozeki, Kenta
    Yamashita, Tomoki
    GRAPHS AND COMBINATORICS, 2008, 24 (05) : 469 - 483
  • [10] Subject Classification. Keywords. graph; degree condition;.
    Lv, Xiangyang
    FILOMAT, 2023, 37 (10) : 3315 - 3320
12345