Full cycle extendability of nearly claw-free graphs.

zbMATH Open1413.05198MaRDI QIDQ2829054FDOQ2829054

Shuxin Zhan, Mingquan Zhan

Publication date: 26 October 2016

Published in: Ars Combinatoria (Search for Journal in Brave)

zbMATH Keywords

line graphHamiltonian connectedfull cycle extendabilitynearly claw-free graphstriangularly connected graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Cited In (3)

• Title not available (Why is that?)
• On cycle-nice claw-free graphs
• Title not available (Why is that?)

   Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On cycle lengths in claw-free graphs with complete closure 👍 👎
• Path extendability of claw-free graphs 👍 👎
• Longest cycles in almost claw-free graphs 👍 👎
• Pancyclicity in claw-free graphs 👍 👎
• On pancyclic claw-free graphs 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Full cycle extendability of nearly claw-free graphs.

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