The following pages link to A method in graph theory (Q1227760):
Displayed 50 items.
- Dominating cycles in regular 3-connected graphs (Q1193714) (← links)
- A sufficient condition for Hamiltonian circuits (Q1223311) (← links)
- A note on stable graphs (Q1242176) (← links)
- A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity (Q1297407) (← links)
- 9-connected claw-free graphs are Hamilton-connected (Q1305527) (← links)
- A note on \(K_ 4\)-closures in hamiltonian graph theory (Q1309444) (← links)
- A closure concept based on neighborhood unions of independent triples (Q1313822) (← links)
- Subgraphs, closures and hamiltonicity (Q1329802) (← links)
- On the computational complexity of graph closures (Q1351617) (← links)
- Dirac's minimum degree condition restricted to claws (Q1356453) (← links)
- Cycles through subsets with large degree sums (Q1363686) (← links)
- Small cycles in Hamiltonian graphs (Q1372743) (← links)
- On a conjecture on directed cycles in a directed bipartite graph (Q1376065) (← links)
- A new Chvátal type condition for pancyclicity (Q1376066) (← links)
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs (Q1376071) (← links)
- Cycles through given vertices and closures (Q1422413) (← links)
- A note on computing graph closures (Q1422436) (← links)
- Vertex pancyclic graphs (Q1613376) (← links)
- On one extension of Dirac's theorem on Hamiltonicity (Q1630770) (← links)
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path (Q1671309) (← links)
- Hamiltonian numbers in oriented graphs (Q1679516) (← links)
- Spectral radius and \(k\)-connectedness of a graph (Q1744085) (← links)
- The number of edges, spectral radius and Hamilton-connectedness of graphs (Q1752616) (← links)
- Hamiltonian jump graphs (Q1763338) (← links)
- On Hamiltonian colorings of graphs (Q1772412) (← links)
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences (Q1773366) (← links)
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness (Q1801685) (← links)
- A new proof of Wojcicka's conjecture (Q1811074) (← links)
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\) (Q1864591) (← links)
- New sufficient conditions for bipancyclic bipartite graphs (Q1883243) (← links)
- On the structure of the set of cycle lengths in a Hamiltonian graph (Q1883261) (← links)
- Hamiltonian degree conditions for tough graphs (Q1896350) (← links)
- Two vertex-disjoint cycles in a graph (Q1906862) (← links)
- Degree sequences and the existence of \(k\)-factors (Q1926057) (← links)
- A vertex cover with chorded 4-cycles (Q1942183) (← links)
- The Hamiltonian numbers in digraphs (Q1956235) (← links)
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree (Q1987005) (← links)
- Spectral results on Hamiltonian problem (Q1999737) (← links)
- Hamiltonian spectra of graphs (Q2000574) (← 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)
- On sufficient topological indices conditions for properties of graphs (Q2025083) (← links)
- Wiener index, Harary index and graph properties (Q2030437) (← links)
- Closure and spanning trees with bounded total excess (Q2045377) (← links)
- Turán problems for Berge-\((k, p)\)-fan hypergraph (Q2047221) (← links)
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs (Q2053709) (← links)
- A generalization of a theorem of Nash-Williams (Q2102754) (← links)
- Further results on the generalized Turán number of spanning linear forests (Q2107129) (← links)
- Improved sufficient conditions for \(k\)-leaf-connected graphs (Q2127608) (← links)
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons (Q2138145) (← links)