Graph whose edges are in small cycles

DOI10.1016/0012-365X(91)90302-IMaRDI QIDQ1182734zbMATH OpenOpenAlexFDO

Authors Hong-Jian Lai

Publication date 28 June 1992

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0012-365x(91)90302-i

zbMATH Keywords

dominating closed trail2-connected graphcollapsible graphssmall cyclesclosed spanning trailcollapsible subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40) Structural characterization of families of graphs (05C75)

Recommendations

• Cycles in graphs with small density
• Number of cycles of small length in a graph
• Small cycles in the star graph
• Small cycles in the pancake graph
• Small cycles in Hamiltonian graphs
• Pancyclism and small cycles in graphs
• scientific article; zbMATH DE number 3853109
• Graphs which are linked cycles
• Small bipancyclic graphs

Cites work

• scientific article; zbMATH DE number 4081604 (Why is no real title available?)
• scientific article; zbMATH DE number 861308 (Why is no real title available?)
• A reduction method to find spanning Eulerian subgraphs
• Graph theory

Cited in

(12)

• Duality in graph families
• On distance local connectivity and the Hamiltonian index
• Induced nets and Hamiltonicity of claw-free graphs
• On Hamiltonicity of 3-connected claw-free graphs
• Hamilton-connected indices of graphs
• Spanning connectivity of the power of a graph and Hamilton-connected index of a graph
• Forbidden subgraphs and weak locally connected graphs
• On Hamiltonicity of 2-connected claw-free graphs
• Cycles in graphs with small density
• Collapsible biclaw-free graphs
• Hamiltonian claw-free graphs with locally disconnected vertices
• Forbidden subgraphs for collapsible graphs and supereulerian graphs

This page was built for publication: Graph whose edges are in small cycles

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