Pages that link to "Item:Q1307442"

The following pages link to On the existence of disjoint cycles in a graph (Q1307442):

Displaying 50 items.

• On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
• Neighborhood unions for the existence of disjoint chorded cycles in graphs (Q367086) (← links)
• On directed versions of the Corrádi-Hajnal corollary (Q404438) (← links)
• A note on disjoint cycles (Q413261) (← links)
• On a sharp degree sum condition for disjoint chorded cycles in graphs (Q604663) (← links)
• Disjoint cycles and spanning graphs of hypercubes (Q704283) (← links)
• Neighborhood unions and disjoint chorded cycles in graphs (Q764874) (← links)
• Independence number and vertex-disjoint cycles (Q878646) (← links)
• Subdivisions of graphs: A generalization of paths and cycles (Q941389) (← links)
• Packing disjoint cycles over vertex cuts (Q973127) (← links)
• Disjoint chorded cycles in graphs (Q998485) (← links)
• Degree condition for subdivisions of unicyclic graphs (Q1015434) (← links)
• Covering the vertices of a graph with cycles of bounded length (Q1025448) (← links)
• Ore-type conditions implying 2-factors consisting of short cycles (Q1044946) (← links)
• On the maximum number of independent cycles in a graph (Q1301840) (← links)
• Covering vertices of a graph by \(k\) disjoint cycles (Q1406550) (← links)
• Partition of a graph into cycles and degenerated cycles (Q1422422) (← links)
• Disproof of a conjecture on the existence of the path-recursive period for a connected graph (Q1587898) (← links)
• The confirmation of a conjecture on disjoint cycles in a graph (Q1660280) (← links)
• On degree sum conditions for 2-factors with a prescribed number of cycles (Q1660281) (← links)
• Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
• On the difference between Hamilton cycles and 2-factors with a prescribed number of cycles (Q1689917) (← links)
• On the existence of vertex-disjoint subgraphs with high degree sum (Q1693134) (← links)
• Fan-type condition on disjoint cycles in a graph (Q1699571) (← links)
• Degree conditions for the existence of vertex-disjoint cycles and paths: a survey (Q1706420) (← links)
• Disjoint cliques in claw-free graphs (Q1709414) (← links)
• Graphs containing every 2-factor (Q1926028) (← links)
• An improvement of Lichiardopol's theorem on disjoint cycles in tournaments (Q2008499) (← links)
• Results and problems on chorded cycles: a survey (Q2102760) (← links)
• Disjoint cycles and chorded cycles in a graph with given minimum degree (Q2174581) (← links)
• On vertex-disjoint triangles in tripartite graphs and multigraphs (Q2227977) (← links)
• Disjoint chorded cycles in graphs with high Ore-degree (Q2232037) (← links)
• A refinement of theorems on vertex-disjoint chorded cycles (Q2361086) (← links)
• An Ore-type analogue of the Sauer-Spencer theorem (Q2385133) (← links)
• Disjoint cycles in graphs with distance degree sum conditions (Q2400552) (← links)
• Partial degree conditions and cycle coverings in bipartite graphs (Q2409530) (← links)
• On vertex-disjoint cycles and degree sum conditions (Q2411618) (← links)
• On the problem of finding disjoint cycles and dicycles in a digraph (Q2428634) (← links)
• Edge-dominating cycles in graphs (Q2462364) (← links)
• Existence of two disjoint long cycles in graphs (Q2581410) (← links)
• On degree sum conditions and vertex-disjoint chorded cycles (Q2657059) (← links)
• A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set (Q2869469) (← links)
• (Q3300710) (← links)
• Recent Results on Disjoint Cycles in Graphs (Q3439373) (← links)
• Disjoint cycles with chords in graphs (Q3605162) (← links)
• ON DISJOINT CYCLES (Q4304619) (← links)
• (Q4568185) (← links)
• On Directed 2-factors in Digraphs and 2-factors Containing Perfect Matchings in Bipartite Graphs (Q4602862) (← links)
• A Sharp Dirac–Erdős Type Bound for Large Graphs (Q4635509) (← links)
• Strengthening Theorems of Dirac and Erdős on Disjoint Cycles (Q4978446) (← links)