The following pages link to A method in graph theory (Q1227760):
Displayed 50 items.
- Stability in the Erdős-Gallai theorems on cycles and paths (Q326812) (← links)
- Generalization of matching extensions in graphs. IV: Closures (Q343759) (← links)
- Hamiltonian cycles in critical graphs with large maximum degree (Q343761) (← links)
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey (Q383779) (← links)
- Improved degree conditions for Hamiltonian properties (Q432715) (← links)
- Hamilton cycles in dense vertex-transitive graphs (Q462925) (← links)
- Best monotone degree conditions for graph properties: a survey (Q489335) (← links)
- Best monotone degree conditions for binding number and cycle structure (Q496429) (← links)
- Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs (Q501276) (← links)
- Spectral conditions for some graphical properties (Q526290) (← links)
- On protein structure alignment under distance constraint (Q553356) (← links)
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← links)
- A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence (Q626786) (← links)
- Best monotone degree conditions for binding number (Q641165) (← links)
- \(\alpha\)-degree closures for graphs (Q658065) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Spanning \(k\)-trees of \(n\)-connected graphs (Q659713) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- The generating graph of some monolithic groups. (Q662032) (← links)
- Partition of a bipartite graph into cycles (Q686183) (← links)
- On existence theorems (Q686508) (← links)
- Computation of the 0-dual closure for hamiltonian graphs (Q686512) (← links)
- On the generating graphs of symmetric groups (Q721699) (← links)
- Collapsible graphs and Hamiltonicity of line graphs (Q742590) (← links)
- Closure and spanning \(k\)-trees (Q742606) (← links)
- Extending cycles in graphs (Q750461) (← links)
- Closed trail decompositions of some classes of regular graphs (Q764903) (← links)
- Berge cycles in non-uniform hypergraphs (Q783055) (← links)
- Stability results on the circumference of a graph (Q783243) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- A generalization of the Bondy-Chvátal theorem on the k-closure (Q792341) (← links)
- Two theorems on Hamiltonian graphs (Q800937) (← links)
- Degree conditions for Hamiltonicity: counting the number of missing edges (Q868355) (← links)
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs (Q868356) (← links)
- Edge bounds in nonhamiltonian \(k\)-connected graphs (Q879332) (← links)
- Subdivision extendibility (Q879940) (← links)
- All complete graph-wheel planar Ramsey numbers (Q897297) (← links)
- On a neighborhood condition implying the existence of disjoint complete graphs (Q911615) (← links)
- Implicit-degrees and circumferences (Q913815) (← links)
- A short proof of a theorem about the circumference of a graph (Q916676) (← links)
- Some localization theorems on Hamiltonian circuits (Q920111) (← links)
- The Ramsey numbers for stars of even order versus a wheel of order nine (Q942144) (← links)
- Degree conditions on induced claws (Q998442) (← links)
- Removable matchings and Hamiltonian cycles (Q1011771) (← links)
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs (Q1024477) (← links)
- A degree condition implying that every matching is contained in a Hamiltonian cycle (Q1025570) (← links)
- \(\beta\)-neighborhood closures for graphs (Q1025907) (← links)
- \(\beta \)-degree closures for graphs (Q1025908) (← links)
- On the spanning fan-connectivity of graphs (Q1028100) (← links)
- On 2-factors with cycles containing specified vertices in a bipartite graph (Q1034963) (← links)