On s-fully cycle extendable line graphs

MaRDI QIDQ5000319zbMATH OpenFDO

Authors Yehong Shao, Huiya Yan

Publication date 12 July 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p386.pdf

zbMATH Keywords

fully cycle extendable graphstrail extendability in a graph

Mathematics Subject Classification ID

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

Recommendations

• Path extendability of s-vertex connected graphs
• scientific article; zbMATH DE number 819122
• Degree conditions and cycle extendability
• A strengthening of Kikustapos;s theorem
• Full cycle extendability of nearly claw-free graphs.

Cites work

• s-vertex pancyclic index
• Connectivity of iterated line graphs
• Essential edge connectivity of line graphs
• Graph theory with applications
• Hamiltonian index is NP-complete
• scientific article; zbMATH DE number 3851144 (Why is no real title available?)
• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• scientific article; zbMATH DE number 3438910 (Why is no real title available?)
• On distance local connectivity and the Hamiltonian index
• On Eulerian and Hamiltonian Graphs and Line Graphs
• On the Hamiltonian index
• Panconnected index of graphs
• Spanning 3-connected index of graphs
• The \(s\)-Hamiltonian index
• The Chvàtal-Erdős condition for supereulerian graphs and the Hamiltonian index
• The hamiltonian index of a 2-connected graph
• The hamiltonian index of a graph
• The index problem of group connectivity

Cited in

(4)

• The S^2NS digraphs and the cycle linear system of a digraph
• Path extendability of s-vertex connected graphs
• scientific article; zbMATH DE number 786151 (Why is no real title available?)
• On traceable iterated line graph and Hamiltonian path index

This page was built for publication: On \(s\)-fully cycle extendable line graphs

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