On degree sum conditions and vertex-disjoint chorded cycles

DOI10.1007/S00373-020-02227-ZMaRDI QIDQ2657059zbMATH OpenOpenAlexFDO

Authors Bradley Elliott, Kazuhide Hirohata, Ronald Gould

Publication date 17 March 2021

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1911.08686

zbMATH Keywords

biconnected componentsblocksdegree sequenceminimum degree sumvertex-disjoint chorded cycles

Mathematics Subject Classification ID

Vertex degrees (05C07) Paths and cycles (05C38)

Abstract: In this paper, we consider a general degree sum condition sufficient to imply the existence of $k$ vertex-disjoint chorded cycles in a graph $G$. Let $sigm{a}_t(G)$ be the minimum degree sum of $t$ independent vertices of $G$. We prove that if $G$ is a graph of sufficiently large order and $sigm{a}_t(G)geq3kt-t+1$ with $kgeq1$, then $G$ contains $k$ vertex-disjoint chorded cycles. We also show that the degree sum condition on $sigm{a}_t(G)$ is sharp. To do this, we also investigate graphs without chorded cycles.

Recommendations

• On independent triples and vertex-disjoint chorded cycles in graphs
• On the maximum number of disjoint chorded cycles in graphs.
• On vertex-disjoint cycles and degree sum conditions
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Degree sum conditions and vertex-disjoint cycles in a graph

Cites work

• Degree sum conditions and vertex-disjoint cycles in a graph
• scientific article; zbMATH DE number 6271443 (Why is no real title available?)
• scientific article; zbMATH DE number 3270498 (Why is no real title available?)
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• On independent triples and vertex-disjoint chorded cycles in graphs
• On the existence of disjoint cycles in a graph
• On the maximal number of independent circuits in a graph
• On the maximum number of independent cycles in a graph
• On the number of independent chorded cycles in a graph
• On vertex-disjoint cycles and degree sum conditions
• The confirmation of a conjecture on disjoint cycles in a graph

Cited in

(12)

• A vertex cover with chorded 4-cycles
• Results and problems on chorded cycles: a survey
• Disjoint chorded cycles in graphs with high Ore-degree
• On independent doubly chorded cycles
• On vertex-disjoint cycles and degree sum conditions
• On the maximum number of disjoint chorded cycles in graphs.
• On independent triples and vertex-disjoint chorded cycles in graphs
• Degree sum conditions and vertex-disjoint cycles in a graph
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• Vertex-disjoint chorded cycles in a graph
• On vertex-disjoint chorded cycles and degree sum conditions
• Disjoint chorded cycles in a 2-connected graph

This page was built for publication: On degree sum conditions and vertex-disjoint chorded cycles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2657059)