A method in graph theory

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
Title not available (Why is that?)
On Hamilton's ideals
Note on Hamilton Circuits
Some Theorems on Abstract Graphs
Parallel concepts in graph theory
The Ramsey number for stripes
n-Hamiltonian graphs

Cited In (only showing first 100 items - show all)

A closure concept based on neighborhood unions of independent triples
On the structure of the set of cycle lengths in a Hamiltonian graph
Removable matchings and Hamiltonian cycles
Vertex pancyclic graphs
Hamiltonian degree conditions for tough graphs
Signless Laplacian spectral conditions for Hamiltonicity of graphs
Degree sequences and the existence of \(k\)-factors
THE RAMSEY NUMBERS FOR STARS OF ODD ORDER VERSUS A WHEEL OF ORDER NINE
Some Hamiltonian Properties of One-Conflict Graphs
Closure and spanning trees with bounded total excess
Neighborhood unions and extremal spanning trees
Hamiltonism, degree sum and neighborhood intersections
How many conjectures can you stand? A survey
Partition of a bipartite graph into cycles
Cycles through subsets with large degree sums
A generalization of a result of Häggkvist and Nicoghossian
Spectral radius and Hamiltonicity of graphs
Scattering number and extremal non-Hamiltonian graphs
Exact bipartite Turán numbers of large even cycles
Extending cycles in graphs
Signless Laplacian spectral radius and Hamiltonicity
On spanning connected graphs
A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
On protein structure alignment under distance constraint
Spanning trees: A survey
Cycles through given vertices and closures
Spectral analogues of Erdős’ and Moon–Moser’s theorems on Hamilton cycles
Some localization theorems on Hamiltonian circuits
Improved degree conditions for Hamiltonian properties
Graph theory (algorithmic, algebraic, and metric problems)
Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity
Hamilton cycles and paths in vertex-transitive graphs-current directions
A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
Two theorems on Hamiltonian graphs
Implicit-degrees and circumferences
Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
Stability of arc-transitive graphs
Extending cycles in bipartite graphs
Closure operation for even factors on claw-free graphs
The Ramsey numbers for stars of even order versus a wheel of order nine
Degree conditions on induced claws
Hamilton cycles in dense vertex-transitive graphs
On Hamiltonian cycles and Hamiltonian paths
A generalization of the Bondy-Chvátal theorem on the k-closure
Extremal problems on distance spectra of graphs
Spectral radius and Hamiltonicity of graphs with large minimum degree
Dirac's minimum degree condition restricted to claws
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence
Degree conditions on claws and modified claws for Hamiltonicity of graphs
Subdivision extendibility
Generalization of matching extensions in graphs. IV: Closures
Hamiltonian cycles in critical graphs with large maximum degree
On Hamiltonian colorings of graphs
Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
Best monotone degree conditions for graph properties: a survey
Dominating cycles in regular 3-connected graphs
\(\beta\)-neighborhood closures for graphs
Best monotone degree conditions for binding number and cycle structure
Improved sufficient conditions for Hamiltonian properties
Spectral radius and \(k\)-connectedness of a graph
Stability in the Erdős-Gallai theorems on cycles and paths
Spanning \(k\)-trees of \(n\)-connected graphs
Best monotone degree conditions for binding number
Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs
Collapsible graphs and Hamiltonicity of line graphs
On sufficient spectral radius conditions for Hamiltonicity
On 2-factors with cycles containing specified vertices in a bipartite graph
On the circumference of a graph and its complement
On the spanning fan-connectivity of graphs
\(\alpha\)-degree closures for graphs
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
A sufficient condition for Hamiltonian circuits
Small cycles in Hamiltonian graphs
On hyper-Hamiltonicity in graphs
\(\beta \)-degree closures for graphs
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
The generating graph of some monolithic groups.
On k-leaf-connected graphs
Semi-independence number of a graph and the existence of Hamiltonian circuits
Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
Neighbourhood unions and Hamiltonian properties in graphs
Spectral conditions for some graphical properties
Some sufficient conditions for graphs to be \(k\)-leaf-connected
Berge cycles in non-uniform hypergraphs
Stability results on the circumference of a graph
Moore-penrose inverse of the incidence matrix of a tree
A Ring Construction Using Finite Directed Graphs
On the computational complexity of graph closures
Bipartite independent number and Hamilton-biconnectedness of bipartite graphs
The Hamiltonian numbers in digraphs
A note on computing graph closures
A short proof of a theorem about the circumference of a graph
On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
Nordhaus-Gaddum type inequalities for the distinguishing index
Hamiltonian cycles and tight cutsets
Connectivity preserving Hamiltonian cycles in \(k\)-connected Dirac graphs
An improvement of spectral conditions for Hamilton-connected graphs
Hamiltonian spectra of graphs
An improvement of sufficient condition for \(k\)-leaf-connected graphs

This page was built for publication: A method in graph theory

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1227760)