Pages that link to "Item:Q801082"

The following pages link to New sufficient conditions for cycles in graphs (Q801082):

Displaying 50 items.

• A short proof of Fan's theorem (Q1887652) (← links)
• Independent sets, cliques and hamiltonian graphs (Q1900523) (← links)
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs (Q2023732) (← links)
• The H-force sets of the graphs satisfying the condition of Ore's theorem (Q2053412) (← links)
• Disjoint cycles and \(2\)-factors with Fan-type condition in a graph (Q2075536) (← links)
• Hamiltonian paths, unit-interval complexes, and determinantal facet ideals (Q2168562) (← links)
• Compatible spanning circuits in edge-colored graphs (Q2182217) (← links)
• On implicit heavy subgraphs and Hamiltonicity of 2-connected graphs (Q2214314) (← links)
• Almost Eulerian compatible spanning circuits in edge-colored graphs (Q2219966) (← links)
• 2-connected Hamiltonian claw-free graphs involving degree sum of adjacent vertices (Q2282467) (← links)
• Long paths in bipartite graphs and path-bistar bipartite Ramsey numbers (Q2303439) (← links)
• Forbidden subgraphs for longest cycles to contain vertices with large degrees (Q2346330) (← links)
• Heavy subgraphs, stability and Hamiltonicity (Q2364090) (← links)
• An efficient condition for a graph to be Hamiltonian (Q2383542) (← links)
• Neighborhood-union condition for an \([a, b]\)-factor avoiding a specified Hamiltonian cycle (Q2400580) (← links)
• A degree condition for a graph to have \((a,b)\)-parity factors (Q2411624) (← links)
• Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
• Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity (Q2445260) (← links)
• New sufficient condition for Hamiltonian graphs (Q2463936) (← links)
• Degree conditions on claws and modified claws for Hamiltonicity of graphs (Q2477384) (← links)
• Fan-type results for the existence of [\(a\),\(b\)]-factors (Q2488945) (← links)
• Toughness in graphs -- a survey (Q2494126) (← links)
• Fan-type theorem for path-connectivity (Q2563518) (← links)
• A fan-type condition for cyclability (Q2581424) (← links)
• Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs (Q2630334) (← links)
• A Fan-type condition for graphs to be \(k\)-leaf-connected (Q2659176) (← links)
• Transversals and bipancyclicity in bipartite graph families (Q2665966) (← links)
• Hamilton-connected, vertex-pancyclic and bipartite holes (Q2675870) (← links)
• The Turán number of directed paths and oriented cycles (Q2701405) (← links)
• A new short proof of Fan Theorem (Q2831783) (← links)
• Degree and neighborhood intersection conditions restricted to induced subgraphs ensuring Hamiltonicity of graphs (Q2920892) (← links)
• On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity (Q3120260) (← links)
• On maximal paths and circuits of graphs (Q3265306) (← links)
• (Q3680862) (← links)
• Old Hamiltonian Ideas from a New Point of View (Q4344200) (← links)
• Edge disjoint Hamilton cycles in graphs (Q4508618) (← links)
• Empirical Study of Phase Transition of Hamiltonian Cycle Problem in Random Graphs with Degrees Greater Than One (Q4632185) (← links)
• Spanning trees with a bounded number of leaves (Q4690981) (← links)
• Fan's condition on induced subgraphs for circumference and pancyclicity (Q4690991) (← links)
• (Q4855971) (← links)
• Cycles of many lengths in Hamiltonian graphs (Q5102252) (← links)
• AN ALGORITHM FOR FINDING LONGEST CYCLES IN CERTAIN BIPARTITE GRAPHS (Q5249271) (← links)
• Fan type condition and characterization of Hamiltonian graphs (Q5418542) (← links)
• Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs (Q5901555) (← links)
• Degree sum condition on distance 2 vertices for Hamiltonian cycles in balanced bipartite graphs (Q6041867) (← links)
• Degree conditions on copies of forests in graphs (Q6093997) (← links)
• Rainbow structures in a collection of graphs with degree conditions (Q6094031) (← links)
• Pancyclic zero divisor graph over the ring ℤn[i] (Q6115757) (← links)
• Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022 (Q6170531) (← links)
• A sufficient condition for vertex bipancyclicity in balanced bipartite graphs (Q6172209) (← links)