Longest cycles in 4-connected graphs

DOI10.1016/j.disc.2017.07.020zbMath1370.05159OpenAlexW2749817020MaRDI QIDQ2404386

Hao Li, Qiang Sun, Jun-qing Cai

Publication date: 18 September 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.07.020

zbMATH Keywords

independent setcircumferencenon-insertible vertex

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (3)

Some inequalities for the Fan product of \(M\)-tensors ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs

Cites Work

• Unnamed Item
• Cyclable sets of vertices in 3-connected graphs
• Hamiltonism, degree sum and neighborhood intersections
• Longest cycles in 3-connected graphs
• An improvement of fraisse's sufficient condition for hamiltonian graphs
• Cycles through particular subgraphs of claw‐free graphs

This page was built for publication: Longest cycles in 4-connected graphs