The following pages link to A method in graph theory (Q1227760):
Displayed 50 items.
- Graph theory (algorithmic, algebraic, and metric problems) (Q581419) (← 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)
- Extending cycles in graphs (Q750461) (← 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)
- 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)
- On Hamiltonian cycles and Hamiltonian paths (Q1041720) (← links)
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity (Q1043808) (← links)
- A degree sum condition for graphs to be prism Hamiltonian (Q1043943) (← links)
- Signless Laplacian spectral radius and Hamiltonicity (Q1044549) (← links)
- Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity (Q1044910) (← links)
- Hamilton cycles and paths in vertex-transitive graphs-current directions (Q1044917) (← links)
- Hamiltonicity in vertex envelopes of plane cubic graphs (Q1044951) (← links)
- On the circumference of a graph and its complement (Q1045133) (← links)
- The maximum number of diagonals of a cycle in a block (Q1069958) (← links)
- Partition of a bipartite Hamiltonian graph into two cycles (Q1072572) (← links)
- Subgraphs intersecting any Hamiltonian cycle (Q1077429) (← links)
- On k-leaf-connected graphs (Q1080438) (← links)
- Semi-independence number of a graph and the existence of Hamiltonian circuits (Q1088684) (← links)
- A generalization of a result of Häggkvist and Nicoghossian (Q1096650) (← links)
- A note on the computation on the k-closure of a graph (Q1108040) (← links)
- Scattering number and extremal non-Hamiltonian graphs (Q1109047) (← links)
- Extending cycles in bipartite graphs (Q1121281) (← links)
- Neighbourhood unions and Hamiltonian properties in graphs (Q1123212) (← links)
- Partition of a directed bipartite graph into two directed cycles (Q1126308) (← links)
- Minimum graphs with complete k-closure (Q1146691) (← links)
- A catalogue of small maximal nonhamiltonian graphs (Q1161757) (← links)
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs (Q1170256) (← links)
- More powerful closure operations on graphs (Q1174165) (← links)
- Hamiltonism, degree sum and neighborhood intersections (Q1175978) (← links)
- Stable properties of graphs (Q1175986) (← links)