UNAVOIDABLE IMMERSIONS OF 4− AND f(t)−EDGE-CONNECTED GRAPHS

被引：0

作者：

Ding, Guoli ^{[1
]}

Qualls, Brittian ^{[1
]}

机构：

[1] Mathematics Department, Louisiana State University, Baton Rouge,LA, United States

来源：

arXiv |

关键词：

Compendex;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Undirected graphs

引用

共 50 条

[41] Super cyclically edge-connected vertex-transitive graphs of girth at least 5
Jin Xin Zhou
Yan Tao Li
Acta Mathematica Sinica, English Series, 2013, 29 : 1569 - 1580
[42] Super cyclically edge-connected vertex-transitive graphs of girth at least 5
Zhou, Jin Xin
Li, Yan Tao
ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2013, 29 (08) : 1569 - 1580
[43] Two paths joining given vertices in (2k+1)-edge-connected graphs
Kamura, H
ARS COMBINATORIA, 2005, 75 : 13 - 31
[44] Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
Liu, Saihua
Ouyang, Chen
Ou, Jianping
LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (06): : 1146 - 1158
[45] Degree sequences of optimally edge-connected multigraphs
Dankelmann, P
Oellermann, O
ARS COMBINATORIA, 2005, 77 : 161 - 168
[46] Sufficient conditions on the zeroth-order general Randic index for maximally edge-connected graphs
Chen, Zhibing
Su, Guifu
Volkmann, Lutz
DISCRETE APPLIED MATHEMATICS, 2017, 218 : 64 - 70
[47] PATHS CONTAINING 2 ADJACENT EDGES IN (2K + 1)-EDGE-CONNECTED GRAPHS
OKAMURA, H
DISCRETE MATHEMATICS, 1993, 111 (1-3) : 401 - 407
[48] Every infinitely edge-connected graph contains the Farey graph or Tℵ0* t as a minor
Kurkofka, Jan
MATHEMATISCHE ANNALEN, 2022, 382 (3-4) : 1881 - 1900
[49] 2-Reducible Two Paths and an Edge Constructing a Path in (2k+1)-Edge-Connected Graphs
Okamura, Haruko
GRAPHS AND COMBINATORICS, 2010, 26 (04) : 571 - 589
[50] Sufficient Conditions for Maximally Edge-Connected Hypergraphs
Lin-Ken Tong
Er-Fang Shan
Journal of the Operations Research Society of China, 2021, 9 : 119 - 129

← 1 2 3 4 5 →