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)

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

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)