An implicit degree sum condition for cycles through specified vertices

DOI10.1016/J.IPL.2017.09.006MaRDI QIDQ2410579zbMATH OpenOpenAlexFDO

Authors Xing Huang

Publication date 18 October 2017

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

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

zbMATH Keywords

independent setcombinatorial problemsimplicit degreecyclable

Mathematics Subject Classification ID

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

Recommendations

• On implicit degree sum condition for long cycles.
• scientific article; zbMATH DE number 6770098
• An implicit degree condition for long cycles in 2-connected graphs
• An implicit degree condition for cyclability in graphs
• An implicit degree Dirac condition for Hamiltonian cycles.

Cites work

• 2‐neighborhoods and hamiltonian conditions
• A note on Hamiltonian circuits
• A note on a generalisation of Ore's condition
• An algorithm for Hamiltonian cycles under implicit degree conditions.
• An implicit degree condition for cyclability in graphs
• An implicit degree condition for long cycles in 2-connected graphs
• Cycles through prescribed vertices with large degree sum
• Cycles through subsets with large degree sums
• Graph theory with applications
• Hamilton cycles in implicit 2-heavy graphs
• Implicit-degrees and circumferences
• Large cycles in graphs
• Note on Hamilton Circuits
• On degree sum conditions for long cycles and cycles through specified vertices

Cited in

(5)

• On implicit degree sum condition for long cycles.
• A Strange Vertex Condition Coming from Nowhere
• A degree condition for cycles passing through specified vertices and edges
• scientific article; zbMATH DE number 6770098 (Why is no real title available?)
• An implicit degree condition for cyclability in graphs

This page was built for publication: An implicit degree sum condition for cycles through specified vertices

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