The following pages link to Remarks on a paper of Pósa (Q5722820):
Displaying 36 items.
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs (Q501276) (← links)
- The generating graph of some monolithic groups. (Q662032) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- Solution of two problems of P. Erdős concerning Hamiltonian cycles (Q810050) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- Dense arbitrarily partitionable graphs (Q907823) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- A condition for a graph to contain \(k\)-matching. (Q1422440) (← links)
- Vertex pancyclic graphs (Q1613376) (← links)
- Extremal problems on the Hamiltonicity of claw-free graphs (Q1660262) (← links)
- Stability in the Erdős-Gallai theorem on cycles and paths. II (Q1709520) (← links)
- Cycles through prescribed vertices with large degree sum (Q1901041) (← links)
- Maximizing the number of cliques in graphs with given matching number (Q2004083) (← links)
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs (Q2007677) (← links)
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- The maximum size of a nonhamiltonian graph with given order and connectivity (Q2092432) (← links)
- Generalizations of the classics to spanning connectedness (Q2242808) (← links)
- Dense on-line arbitrarily partitionable graphs (Q2357776) (← 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)
- On Hamiltonian bipartite graphs (Q2626464) (← links)
- Hamiltonicity in prime sum graphs (Q2657078) (← links)
- Minimum number of edges guaranteeing the existence of a \(K_{1, t}\)-factor in a graph (Q2689114) (← links)
- Stability of Woodall's theorem and spectral conditions for large cycles (Q2692178) (← links)
- On maximal paths and circuits of graphs (Q3265306) (← links)
- Some new sufficient conditions for 2p-Hamilton-biconnectedness of graphs (Q5080706) (← links)
- Spectral radius and Hamiltonian properties of graphs, II (Q5133410) (← links)
- Extensions of the Erdős–Gallai theorem and Luo’s theorem (Q5222574) (← links)
- Spectral and extremal conditions for supereulerian graphs (Q5870138) (← links)
- The Parameterized Complexity of Graph Cyclability (Q5891809) (← links)
- Ordering \(Q\)-indices of graphs: given size and circumference (Q6056721) (← links)
- The maximum number of complete multipartite subgraphs in graphs with given circumference or matching number (Q6080217) (← links)
- The maximum number of cliques in graphs with prescribed order, circumference and minimum degree (Q6171501) (← links)
- Non-Hamiltonian graphs with large minimum degree (Q6178660) (← links)
