On vertex-disjoint chorded cycles and degree sum conditions

DOI10.61091/jcmcc120-07zbMATH Open1545.05113MaRDI QIDQ6586575FDOQ6586575

Authors: Ronald Gould, Kazuhide Hirohata, Ariel Keller Rorabaugh 

Publication date: 13 August 2024

Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

degree sequenceminimum degree sumvertex-disjoint chorded cycles

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07) Paths and cycles (05C38)

Cites Work

• On the maximal number of independent circuits in a graph
• On the maximum number of independent cycles in a graph
• On the existence of disjoint cycles in a graph
• On a sharp degree sum condition for disjoint chorded cycles in graphs
• On the number of independent chorded cycles in a graph
• Degree sum conditions and vertex-disjoint cycles in a graph
• Title not available (Why is that?)
• On vertex-disjoint cycles and degree sum conditions
• Vertex-disjoint double chorded cycles in bipartite graphs
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
• Partitioning a graph into cycles with a specified number of chords

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

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