An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles

Henry Kierstead, A. V. Kostochka, T. Molla, D. Yager

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Corrádi and Hajnal in 1963 proved the following theorem on the NP-complete problem on the existence of k disjoint cycles in an n-vertex graph G: For all k ≥ 1 and n ≥ 3k, every (simple) n-vertex graph G with minimum degree δ(G) ≥ 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not containing two disjoint cycles and asked the more general question: Which (2k − 1)-connected multigraphs do not contain k disjoint cycles? Recently, Kierstead, Kostochka, and Yeager resolved this question. In this paper, we sharpen this result by presenting a description that can be checked in polynomial time of all multigraphs G with no k disjoint cycles for which the underlying simple graph G̲ satisfies the following Ore-type condition: dG̲(v)+dG̲(u)≥4k−3 for all nonadjacent u, v ∈ V (G).

Original languageEnglish (US)
Title of host publicationSpringer Optimization and Its Applications
PublisherSpringer International Publishing
Pages149-168
Number of pages20
DOIs
StatePublished - Jan 1 2018

Publication series

NameSpringer Optimization and Its Applications
Volume139
ISSN (Print)1931-6828
ISSN (Electronic)1931-6836

Fingerprint

Paul Adrien Maurice Dirac
Disjoint
Multigraph
Cycle
Minimum Degree
Graph in graph theory
Vertex of a graph
Simple Graph
Polynomial time
NP-complete problem
Theorem

ASJC Scopus subject areas

  • Control and Optimization

Cite this

Kierstead, H., Kostochka, A. V., Molla, T., & Yager, D. (2018). An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles. In Springer Optimization and Its Applications (pp. 149-168). (Springer Optimization and Its Applications; Vol. 139). Springer International Publishing. https://doi.org/10.1007/978-3-319-94830-0_8

An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles. / Kierstead, Henry; Kostochka, A. V.; Molla, T.; Yager, D.

Springer Optimization and Its Applications. Springer International Publishing, 2018. p. 149-168 (Springer Optimization and Its Applications; Vol. 139).

Research output: Chapter in Book/Report/Conference proceedingChapter

Kierstead, H, Kostochka, AV, Molla, T & Yager, D 2018, An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles. in Springer Optimization and Its Applications. Springer Optimization and Its Applications, vol. 139, Springer International Publishing, pp. 149-168. https://doi.org/10.1007/978-3-319-94830-0_8
Kierstead H, Kostochka AV, Molla T, Yager D. An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles. In Springer Optimization and Its Applications. Springer International Publishing. 2018. p. 149-168. (Springer Optimization and Its Applications). https://doi.org/10.1007/978-3-319-94830-0_8
Kierstead, Henry ; Kostochka, A. V. ; Molla, T. ; Yager, D. / An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles. Springer Optimization and Its Applications. Springer International Publishing, 2018. pp. 149-168 (Springer Optimization and Its Applications).
@inbook{e878351dfa5f4ef09981ec894f5eadd6,
title = "An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles",
abstract = "Corr{\'a}di and Hajnal in 1963 proved the following theorem on the NP-complete problem on the existence of k disjoint cycles in an n-vertex graph G: For all k ≥ 1 and n ≥ 3k, every (simple) n-vertex graph G with minimum degree δ(G) ≥ 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not containing two disjoint cycles and asked the more general question: Which (2k − 1)-connected multigraphs do not contain k disjoint cycles? Recently, Kierstead, Kostochka, and Yeager resolved this question. In this paper, we sharpen this result by presenting a description that can be checked in polynomial time of all multigraphs G with no k disjoint cycles for which the underlying simple graph G̲ satisfies the following Ore-type condition: dG̲(v)+dG̲(u)≥4k−3 for all nonadjacent u, v ∈ V (G).",
author = "Henry Kierstead and Kostochka, {A. V.} and T. Molla and D. Yager",
year = "2018",
month = "1",
day = "1",
doi = "10.1007/978-3-319-94830-0_8",
language = "English (US)",
series = "Springer Optimization and Its Applications",
publisher = "Springer International Publishing",
pages = "149--168",
booktitle = "Springer Optimization and Its Applications",

}

TY - CHAP

T1 - An algorithmic answer to the ore-type version of Dirac’s question on disjoint cycles

AU - Kierstead, Henry

AU - Kostochka, A. V.

AU - Molla, T.

AU - Yager, D.

PY - 2018/1/1

Y1 - 2018/1/1

N2 - Corrádi and Hajnal in 1963 proved the following theorem on the NP-complete problem on the existence of k disjoint cycles in an n-vertex graph G: For all k ≥ 1 and n ≥ 3k, every (simple) n-vertex graph G with minimum degree δ(G) ≥ 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not containing two disjoint cycles and asked the more general question: Which (2k − 1)-connected multigraphs do not contain k disjoint cycles? Recently, Kierstead, Kostochka, and Yeager resolved this question. In this paper, we sharpen this result by presenting a description that can be checked in polynomial time of all multigraphs G with no k disjoint cycles for which the underlying simple graph G̲ satisfies the following Ore-type condition: dG̲(v)+dG̲(u)≥4k−3 for all nonadjacent u, v ∈ V (G).

AB - Corrádi and Hajnal in 1963 proved the following theorem on the NP-complete problem on the existence of k disjoint cycles in an n-vertex graph G: For all k ≥ 1 and n ≥ 3k, every (simple) n-vertex graph G with minimum degree δ(G) ≥ 2k contains k disjoint cycles. The same year, Dirac described the 3-connected multigraphs not containing two disjoint cycles and asked the more general question: Which (2k − 1)-connected multigraphs do not contain k disjoint cycles? Recently, Kierstead, Kostochka, and Yeager resolved this question. In this paper, we sharpen this result by presenting a description that can be checked in polynomial time of all multigraphs G with no k disjoint cycles for which the underlying simple graph G̲ satisfies the following Ore-type condition: dG̲(v)+dG̲(u)≥4k−3 for all nonadjacent u, v ∈ V (G).

UR - http://www.scopus.com/inward/record.url?scp=85054178766&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85054178766&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-94830-0_8

DO - 10.1007/978-3-319-94830-0_8

M3 - Chapter

AN - SCOPUS:85054178766

T3 - Springer Optimization and Its Applications

SP - 149

EP - 168

BT - Springer Optimization and Its Applications

PB - Springer International Publishing

ER -