2020
DOI: 10.1016/j.jctb.2019.07.002
|View full text |Cite
|
Sign up to set email alerts
|

7-Connected graphs are 4-ordered

Abstract: A graph G is k-ordered if for any distinct vertices v 1 , v 2 , . . . , v k ∈ V (G), it has a cycle through v 1 , v 2 , . . . , v k in order. Let f (k) denote the minimum integer so that every f (k)-connected graph is k-ordered. The first non-trivial case of determining f (k) is when k = 4, where the previously best known bounds are 7 ≤ f (4) ≤ 40. We prove that in fact f (4) = 7.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
11
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(11 citation statements)
references
References 24 publications
(49 reference statements)
0
11
0
Order By: Relevance
“…X. Yu [25] charaterized all obstructions to P 4 -linked graphs, and showed that 7 ≤ f (P 4 ) ≤ 8, and Ellingham, Plummer, and G. Yu [3] showed that f (P 4 ) = 7. Very recently, McCarty, Wang, and X. Yu [16] showed that f (C 4 ) = 7, that is, 7-connected graphs are 4-ordered, confirming a conjecture of Faudree [4]. Beyond this, very little is known about f (H) for other multigraphs H.…”
Section: Introductionmentioning
confidence: 94%
See 4 more Smart Citations
“…X. Yu [25] charaterized all obstructions to P 4 -linked graphs, and showed that 7 ≤ f (P 4 ) ≤ 8, and Ellingham, Plummer, and G. Yu [3] showed that f (P 4 ) = 7. Very recently, McCarty, Wang, and X. Yu [16] showed that f (C 4 ) = 7, that is, 7-connected graphs are 4-ordered, confirming a conjecture of Faudree [4]. Beyond this, very little is known about f (H) for other multigraphs H.…”
Section: Introductionmentioning
confidence: 94%
“…Lemma 3.1 (McCarty, Wang, and Yu [16]). Let {R 1 , R 2 } be a special (u 1 , u 2 , C, A)-separating pair in a graph G, and let x ∈ int(R 1 ).…”
Section: Separating Pairs and 3-planar Graphsmentioning
confidence: 99%
See 3 more Smart Citations