Cyclable sets of vertices in 3-connected graphs

DOI10.4310/JOC.2016.V7.N2.A14zbMATH Open1336.05075OpenAlexW2720669560MaRDI QIDQ286770FDOQ286770

Authors: Hao Li, Yan Zhu 

Publication date: 25 May 2016

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2016.v7.n2.a14

Recommendations

• Cyclability of 3-connected graphs
• A degree sum condition concerning the connectivity and the independence number of a graph
• Neighborhood unions and cyclability of graphs
• scientific article; zbMATH DE number 5371443
• Cycles containing many vertices of subsets in graphs with large degree sums and neighborhood unions

zbMATH Keywords

Hamiltonian graphs

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38) Connectivity (05C40)

Cited In (11)

• On cycles in 3-connected graphs
• Spanning trees with a bounded number of leaves
• Neighborhood union conditions and cycles through specified vertices
• Degree sum conditions on two disjoint cycles in graphs
• \(D_ \lambda\)-cycles in 3-cyclable graphs
• Longest cycles in 4-connected graphs
• Cyclability in bipartite graphs
• Cyclability of 3-connected graphs
• Modification of \(CZ_3\)-free condition to have a cycle containing specified vertices
• Neighborhood unions and cyclability of graphs
• Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey

This page was built for publication: Cyclable sets of vertices in 3-connected graphs

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