Edge degrees and dominating cycles

DOI10.1016/j.disc.2007.05.003zbMath1169.05042OpenAlexW2069478766MaRDI QIDQ2427518

Kiyoshi Yoshimoto

Publication date: 13 May 2008

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.05.003

zbMATH Keywords

triangle-free graphlongest cycledominating cycleedge degree

Mathematics Subject Classification ID

Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (1)

Relative length of longest paths and longest cycles in triangle-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Existence of Dlambda-cycles and Dlambda-paths
• Longest cycles in triangle-free graphs
• On a 2-factor with a specified edge in a graph satisfying the Ore condition
• Note on Hamilton Circuits
• 2-factors in triangle-free graphs

This page was built for publication: Edge degrees and dominating cycles