Cycles through specified vertices in triangle-free graphs

DOI10.7151/DMGT.1354MaRDI QIDQ5444067zbMATH OpenOpenAlexFDO

Authors Daniël Paulusma, Kiyoshi Yoshimoto

Publication date 22 February 2008

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL http://dro.dur.ac.uk/7426/1/7426.pdf

zbMATH Keywords

cyclepathtriangle-free graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Relative length of longest paths and longest cycles in triangle-free graphs
• Cycles in triangle-free graphs
• Longest cycles in triangle-free graphs
• scientific article; zbMATH DE number 970792
• The Chvátal-Erdös condition for cycles in triangle-free graphs

Cited in

(7)

• Cycles in triangle-free graphs
• Large degree vertices in longest cycles of graphs. I
• A multi-threading algorithm to detect and remove cycles in vertex- and arc-weighted digraph
• Large degree vertices in longest cycles of graphs. II
• Excluding clocks
• Isolation of cycles
• A characterization of the graphs with high degree sum that are not covered by three cycles.

This page was built for publication: Cycles through specified vertices in triangle-free graphs

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