New sufficient conditions for cycles in graphs

Recommendations

A new sufficient condition for pancyclability of graphs
A new sufficient condition for pancyclic graphs
scientific article; zbMATH DE number 12004
A sufficient condition guaranteeing large cycles in graphs
New sufficient conditions for hamiltonian and pancyclic graphs
New sufficient conditions for bipancyclic bipartite graphs
scientific article; zbMATH DE number 4127255
Cycles in graphs and related problems
Publication:4726282
Vertex pancyclicity and new sufficient conditions

Cites work

scientific article; zbMATH DE number 3515497 (Why is no real title available?)
scientific article; zbMATH DE number 3215865 (Why is no real title available?)
scientific article; zbMATH DE number 3186565 (Why is no real title available?)
Large cycles in graphs
Note on Hamilton Circuits
On Hamilton's ideals
Some Theorems on Abstract Graphs

Cited in

(only showing first 100 items - show all)

scientific article; zbMATH DE number 819129 (Why is no real title available?)
Old Hamiltonian Ideas from a New Point of View
Heavy subgraph conditions for longest cycles to be heavy in graphs
Recent advances on the Hamiltonian problem: survey III
On maximal paths and circuits of graphs
A fan-type result on \(k\)-ordered graphs
Cycles through subsets with large degree sums
Cycle spectra of Hamiltonian graphs
Toughness in graphs -- a survey
Edge disjoint Hamilton cycles in graphs
A short proof of a theorem about the circumference of a graph
A new short proof of fan theorem
A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs
Hamilton-connected, vertex-pancyclic and bipartite holes
Hamilton cycles in implicit claw-heavy graphs
New sufficient condition for Hamiltonian graphs
A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
A look at cycles containing specified elements of a graph
Spanning paths in graphs
A cycle structure theorem for Hamiltonian graphs
Fan's condition on induced subgraphs for circumference and pancyclicity
Hamiltonian degree conditions which imply a graph is pancyclic
A sufficient condition for vertex bipancyclicity in balanced bipartite graphs
Structural conditions for cycle completable graphs
A short proof of Fan's theorem
A proof of a conjecture about \(D_ \lambda\)-paths in graphs with large neighborhood unions
A generalization of Bondy's and Fan's sufficient conditions for Hamiltonian graphs
Compatible spanning circuits in edge-colored graphs
Fan-type conditions for spanning Eulerian subgraphs
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
Degree conditions for Hamiltonicity: counting the number of missing edges
Hamilton cycles in claw-heavy graphs
Neighborhood unions and a generalization of Dirac's theorem
An efficient condition for a graph to be Hamiltonian
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
Cycle lengths of Hamiltonian \(P_\ell\)-free graphs
A sufficient condition guaranteeing large cycles in graphs
An implicit degree condition for long cycles in 2-connected graphs
A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity
Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
Minimum implicit degree condition restricted to claws for Hamiltonian cycles
Forbidden subgraphs for longest cycles to contain vertices with large degrees
Quasi-claw-free graphs
Subgraphs, closures and hamiltonicity
Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
Cycles of many lengths in Hamiltonian graphs
Dirac's minimum degree condition restricted to claws
The Ramsey numbers of paths versus wheels: a complete solution
Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
Degree conditions on claws and modified claws for Hamiltonicity of graphs
Some localization theorems on Hamiltonian circuits
On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs
scientific article; zbMATH DE number 3902691 (Why is no real title available?)
A new sufficient condition for Hamiltonian graphs
Implicit degree condition for Hamiltonicity of 2-heavy graphs
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs
Hamiltonian graphs involving neighborhood intersections
Degree conditions for the partition of a graph into cycles, edges and isolated vertices
A condition for a Hamiltonian bipartite graph to be bipancyclic
A sufficient condition involving implicit degree and neighborhood intersection for long cycles
A sufficient condition for pancyclability of graphs
The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
Fan-type results for the existence of [\(a\),\(b\)]-factors
Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
Degree conditions on copies of forests in graphs
Fan type condition and characterization of Hamiltonian graphs
A fan-type condition for cyclability
Kriterien vom Ore-Typ für längste Kreise in 2-zusammenhängenden Graphen
Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
A Fan-type condition for graphs to be \(k\)-leaf-connected
Extremal problems on the Hamiltonicity of claw-free graphs
2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
Transversals and bipancyclicity in bipartite graph families
Heavy subgraphs, stability and Hamiltonicity
Pancyclic zero divisor graph over the ring ℤn[i]
Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle
The Turán number of directed paths and oriented cycles
Chvátal-Erdős condition for pancyclicity
Spanning trees with a bounded number of leaves
HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
Hamiltonicity of claw-free graphs and Fan-type conditions
Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
A degree condition for a graph to have \((a,b)\)-parity factors
Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
Rainbow structures in a collection of graphs with degree conditions
On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
Independent sets, cliques and hamiltonian graphs
The H-force sets of the graphs satisfying the condition of Ore's theorem
Ramsey numbers of odd cycles versus larger even wheels
Almost Eulerian compatible spanning circuits in edge-colored graphs
Disjoint cycles and \(2\)-factors with Fan-type condition in a graph
Fan-type condition on disjoint cycles in a graph
Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One
An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Fan-type theorem for path-connectivity
An algorithm for finding longest cycles in certain bipartite graphs
Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs

This page was built for publication: New sufficient conditions for cycles in graphs

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