The following pages link to (Q5342985):
Displaying 41 items.
- Vertex covers by monochromatic pieces -- a survey of results and problems (Q279224) (← links)
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Neighborhood unions for the existence of disjoint chorded cycles in graphs (Q367086) (← links)
- Monochromatic loose-cycle partitions in hypergraphs (Q405239) (← links)
- An implicit weighted degree condition for heavy cycles (Q472135) (← links)
- Partitioning 2-edge-colored graphs by monochromatic paths and cycles (Q484546) (← links)
- On a sharp degree sum condition for disjoint chorded cycles in graphs (Q604663) (← links)
- Vertex partitions of non-complete graphs into connected monochromatic \(k\)-regular graphs (Q641170) (← links)
- Minimum degree, independence number and pseudo \([2, b]\)-factors in graphs (Q741726) (← links)
- The extremal function for two disjoint cycles (Q745932) (← links)
- Neighborhood unions and disjoint chorded cycles in graphs (Q764874) (← links)
- New sufficient conditions for cycles in graphs (Q801082) (← links)
- Disjoint chorded cycles in graphs (Q998485) (← links)
- Pancyclic graphs and linear forests (Q1011789) (← links)
- Hamiltonian cycles and dominating cycles passing through a linear forest (Q1024474) (← links)
- An implicit degree condition for long cycles in 2-connected graphs (Q1031703) (← links)
- A look at cycles containing specified elements of a graph (Q1045026) (← links)
- Weighted degrees and heavy cycles in weighted graphs (Q1045186) (← links)
- Long cycles in bipartite graphs (Q1059086) (← links)
- Cycles in bipartite graphs (Q1156150) (← links)
- Hamiltonian numbers in oriented graphs (Q1679516) (← links)
- The number of edges, spectral radius and Hamilton-connectedness of graphs (Q1752616) (← links)
- A note on the linear cycle cover conjecture of Gyárfás and Sárközy (Q1753119) (← links)
- Finding long cycles in balanced tripartite graphs: a first step (Q2073190) (← links)
- Ramsey-type results for path covers and path partitions (Q2094874) (← links)
- On the discrepancies of graphs (Q2181999) (← links)
- A stability version for a theorem of Erdős on nonhamiltonian graphs (Q2401804) (← links)
- A variation of a theorem by Pósa (Q2421858) (← links)
- Heavy cycles and spanning trees with few leaves in weighted graphs (Q2430048) (← links)
- Recent advances on the Hamiltonian problem: survey III (Q2441350) (← links)
- Large cycles in graphs (Q2548258) (← links)
- Discrepancies of spanning trees and Hamilton cycles (Q2668020) (← links)
- On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity (Q3120260) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A Note on Color-Bias Hamilton Cycles in Dense Graphs (Q4990398) (← links)
- COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH (Q5151276) (← links)
- The binding number of a graph and its Anderson number (Q5666592) (← links)
- Partitioning Edge-Colored Hypergraphs into Few Monochromatic Tight Cycles (Q5854893) (← links)
- Oriented discrepancy of Hamilton cycles (Q6047963) (← links)
- The Turán number of Berge hypergraphs with stable properties (Q6056469) (← links)
- Methods for determining cycles of a specific length in undirected graphs with edge weights (Q6181338) (← links)
