The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
From MaRDI portal
Publication:1088685
DOI10.1016/0095-8956(87)90038-4zbMath0613.05038OpenAlexW2043193842MaRDI QIDQ1088685
Abdelhamid Benhocine, Adam Paweł Wojda
Publication date: 1987
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(87)90038-4
Related Items
A cycle structure theorem for Hamiltonian graphs, A new sufficient condition for hamiltonicity of graphs, Clique-heavy subgraphs and pancyclicity of 2-connected graphs, An efficient condition for a graph to be Hamiltonian, Extremal problems on the Hamiltonicity of claw-free graphs, A Fan-type condition for graphs to be \(k\)-leaf-connected, An implicit degree condition for pancyclicity of graphs, An implicit degree Ore-condition for pancyclicity of graphs, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, A Fan-type heavy pair of subgraphs for pancyclicity of 2-connected graphs, Hamiltonian degree conditions which imply a graph is pancyclic, A condition for a Hamiltonian bipartite graph to be bipancyclic, A triple of heavy subgraphs ensuring pancyclicity of 2-connected graphs, Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs, A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs, Fan type condition and characterization of Hamiltonian graphs, Fan's condition on induced subgraphs for circumference and pancyclicity, A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness, A new sufficient condition for pancyclability of graphs, Characterizing heavy subgraph pairs for pancyclicity
Cites Work
