Graph whose edges are in small cycles

DOI10.1016/0012-365X(91)90302-IzbMath0761.05059OpenAlexW1976564451MaRDI QIDQ1182734

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) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items

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

Cites Work

• A reduction method to find spanning Eulerian subgraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item