New sufficient conditions for cycles in graphs
From MaRDI portal
Publication:801082
DOI10.1016/0095-8956(84)90054-6zbMATH Open0551.05048OpenAlexW2065748238MaRDI QIDQ801082FDOQ801082
Authors: Genghua Fan 
Publication date: 1984
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(84)90054-6
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
Cited In (only showing first 100 items - show all)
- Toughness in graphs -- a survey
- Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs
- Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
- Title not available (Why is that?)
- Old Hamiltonian Ideas from a New Point of View
- Spanning paths in graphs
- Structural conditions for cycle completable graphs
- Cycles through subsets with large degree sums
- Hamiltonian degree conditions which imply a graph is pancyclic
- Recent advances on the Hamiltonian problem: survey III
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- A condition for a Hamiltonian bipartite graph to be bipancyclic
- A new sufficient condition for Hamiltonian graphs
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- Fan-type conditions for spanning Eulerian subgraphs
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Some localization theorems on Hamiltonian circuits
- Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs
- Compatible spanning circuits in edge-colored graphs
- Degree conditions for Hamiltonicity: counting the number of missing edges
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- Degree condition for the existence of a \(k\)-factor containing a given Hamiltonian cycle
- Hamilton-connected, vertex-pancyclic and bipartite holes
- Hamilton cycles in implicit claw-heavy graphs
- A sufficient condition for vertex bipancyclicity in balanced bipartite 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
- Degree conditions for the partition of a graph into cycles, edges and isolated vertices
- A look at cycles containing specified elements of a graph
- 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 sufficient condition for pancyclability of graphs
- A fan-type result on \(k\)-ordered graphs
- New sufficient condition for Hamiltonian graphs
- Cycle lengths of Hamiltonian \(P_\ell\)-free graphs
- Degree conditions for Hamiltonian graphs to have \([a,b]\)-factors containing a given Hamiltonian cycle
- Hamilton cycles in claw-heavy graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Dirac's minimum degree condition restricted to claws
- A sufficient condition involving implicit degree and neighborhood intersection for long cycles
- The Geng-Hua Fan conditions for pancyclic or Hamilton-connected graphs
- Cycles of many lengths in Hamiltonian graphs
- Degree conditions on claws and modified claws for Hamiltonicity of graphs
- Hamiltonian graphs involving neighborhood intersections
- On maximal paths and circuits of graphs
- Neighborhood unions and a generalization of Dirac's theorem
- Fan-type results for the existence of [\(a\),\(b\)]-factors
- Cycle spectra of Hamiltonian graphs
- Edge disjoint Hamilton cycles in graphs
- The Ramsey numbers of paths versus wheels: a complete solution
- A short proof of a theorem about the circumference of a graph
- Implicit degree condition for Hamiltonicity of 2-heavy graphs
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- 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 cycle structure theorem for Hamiltonian graphs
- 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
- Title not available (Why is that?)
- An efficient condition for a graph to be Hamiltonian
- A sufficient condition guaranteeing large cycles in graphs
- A new short proof of fan theorem
- A short proof of Fan's theorem
- Almost Eulerian compatible spanning circuits in edge-colored graphs
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle
- Hamiltonicity of claw-free graphs and Fan-type conditions
- 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
- On a Goodman-Hedetniemi sufficient condition for graph Hamiltonicity
- An algorithm for finding longest cycles in certain bipartite graphs
- A fan-type condition for cyclability
- Spanning trees with a bounded number of leaves
- The H-force sets of the graphs satisfying the condition of Ore's theorem
- Fan type condition and characterization of Hamiltonian graphs
- Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
- Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
- Transversals and bipancyclicity in bipartite graph families
- Chvátal-Erdős condition for pancyclicity
- Rainbow structures in a collection of graphs with degree conditions
- Independent sets, cliques and hamiltonian graphs
- Degree conditions on copies of forests in graphs
- Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs
- Sufficient conditions for Hamiltonian properties of graphs based on the difference of Zagreb indices
- Fan-type condition on disjoint cycles in a graph
- Extremal problems on the Hamiltonicity of claw-free graphs
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Fan-type theorem for path-connectivity
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices
- An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian
- Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs
- Disjoint cycles and \(2\)-factors with Fan-type condition in a graph
- The Turán number of directed paths and oriented cycles
- Implicit degree condition restricted to essential independent sets for Hamiltonian cycles
- Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers
- Ramsey numbers of odd cycles versus larger even wheels
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)
