Degree sum conditions on two disjoint cycles in graphs

DOI10.1016/j.ipl.2018.05.004zbMath1391.05088OpenAlexW2804764509WikidataQ129765059 ScholiaQ129765059MaRDI QIDQ1653021

Jin Yan, Shaohua Zhang, Jun-qing Cai, Yan-Yan Ren

Publication date: 17 July 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2018.05.004

zbMATH Keywords

cyclegraph algorithmsdegree sumpancyclicdisjoint

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Vertex degrees (05C07)

Related Items (1)

An Ore-type condition for the existence of two disjoint cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cyclable sets of vertices in 3-connected graphs
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles
• Proof of the Erdős-Faudree conjecture on quadrilaterals
• On circuits in graphs
• Longest cycles in 3-connected graphs
• Advances on the Hamiltonian problem -- a survey
• Fan-type condition on disjoint cycles in a graph
• Graphs containing every 2-factor
• Disjoint cycles in graphs with distance degree sum conditions
• Pancyclic graphs. I
• Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Some Theorems on Abstract Graphs
• Disjoint triangles and quadrilaterals in a graph

This page was built for publication: Degree sum conditions on two disjoint cycles in graphs