A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness

DOI10.1016/0012-365X(93)90476-AzbMATH Open0773.05075MaRDI QIDQ1801685FDOQ1801685

Authors: P. Bedrossian, Guantao Chen, R. H. Schelp 

Publication date: 20 June 1993

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

Recommendations

• scientific article; zbMATH DE number 540116
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• A new sufficient condition for Hamiltonian graphs
• scientific article; zbMATH DE number 4104998
• scientific article; zbMATH DE number 3983207

zbMATH Keywords

pancyclicityHamiltonicityFan's conditionHamiltonian connectedness

Mathematics Subject Classification ID

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

Cites Work

• Note on Hamilton Circuits
• New sufficient conditions for cycles in graphs
• Large cycles in graphs
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• A method in graph theory
• A cycle structure theorem for Hamiltonian graphs

Cited In (27)

• Old Hamiltonian Ideas from a New Point of View
• Heavy subgraphs, stability and Hamiltonicity
• Heavy subgraph pairs for traceability of block-chains
• Title not available (Why is that?)
• Fan type condition and characterization of Hamiltonian graphs
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
• Heavy cycles in \(k\)-connected weighted graphs with large weighted degree sums
• Claw-free graphs---a survey
• Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
• A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity
• Fan's condition on induced subgraphs for circumference and pancyclicity
• Quasi-claw-free graphs
• A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs
• A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
• An implicit degree condition for long cycles in 2-connected graphs
• A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs
• Hamilton cycles in claw-heavy graphs
• Dirac's minimum degree condition restricted to claws
• A sufficient condition involving implicit degree and neighborhood intersection for long cycles
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
• The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
• Degree conditions on claws and modified claws for Hamiltonicity of graphs
• Title not available (Why is that?)
• Heavy cycles in k-connected weighted graphs
• On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
• Characterizing heavy subgraph pairs for pancyclicity
• A sufficient condition guaranteeing large cycles in graphs

This page was built for publication: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness

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