A method in graph theory
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3261280 (Why is no real title available?)
- scientific article; zbMATH DE number 3293646 (Why is no real title available?)
- scientific article; zbMATH DE number 3298608 (Why is no real title available?)
- scientific article; zbMATH DE number 3349867 (Why is no real title available?)
- scientific article; zbMATH DE number 3186565 (Why is no real title available?)
- n-Hamiltonian graphs
- Note on Hamilton Circuits
- On Hamilton's ideals
- Parallel concepts in graph theory
- Some Theorems on Abstract Graphs
- The Ramsey number for stripes
Cited in
(only showing first 100 items - show all)- Removable matchings and Hamiltonian cycles
- A fast parallel algorithm for finding Hamiltonian cycles in dense graphs
- A degree condition implying that every matching is contained in a Hamiltonian cycle
- \(\beta\)-neighborhood closures for graphs
- \(\beta \)-degree closures for graphs
- On the spanning fan-connectivity of graphs
- On 2-factors with cycles containing specified vertices in a bipartite graph
- On Hamiltonian cycles and Hamiltonian paths
- Dirac's type sufficient conditions for hamiltonicity and pancyclicity
- A degree sum condition for graphs to be prism Hamiltonian
- Signless Laplacian spectral radius and Hamiltonicity
- Connected graphs as subgraphs of Cayley graphs: conditions on hamiltonicity
- Hamilton cycles and paths in vertex-transitive graphs-current directions
- Hamiltonicity in vertex envelopes of plane cubic graphs
- On the circumference of a graph and its complement
- The maximum number of diagonals of a cycle in a block
- Partition of a bipartite Hamiltonian graph into two cycles
- Subgraphs intersecting any Hamiltonian cycle
- On k-leaf-connected graphs
- Semi-independence number of a graph and the existence of Hamiltonian circuits
- A generalization of a result of Häggkvist and Nicoghossian
- A note on the computation on the k-closure of a graph
- Scattering number and extremal non-Hamiltonian graphs
- Extending cycles in bipartite graphs
- Neighbourhood unions and Hamiltonian properties in graphs
- Partition of a directed bipartite graph into two directed cycles
- Minimum graphs with complete k-closure
- A catalogue of small maximal nonhamiltonian graphs
- Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs
- More powerful closure operations on graphs
- Hamiltonism, degree sum and neighborhood intersections
- Stable properties of graphs
- Dominating cycles in regular 3-connected graphs
- A sufficient condition for Hamiltonian circuits
- A note on stable graphs
- A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity
- 9-connected claw-free graphs are Hamilton-connected
- A note on \(K_ 4\)-closures in hamiltonian graph theory
- A closure concept based on neighborhood unions of independent triples
- Subgraphs, closures and hamiltonicity
- On the computational complexity of graph closures
- Dirac's minimum degree condition restricted to claws
- Cycles through subsets with large degree sums
- Small cycles in Hamiltonian graphs
- On a conjecture on directed cycles in a directed bipartite graph
- A new Chvátal type condition for pancyclicity
- Degree sum conditions for Hamiltonicity on \(k\)-partite graphs
- Cycles through given vertices and closures
- A note on computing graph closures
- Vertex pancyclic graphs
- On one extension of Dirac's theorem on Hamiltonicity
- Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path
- Hamiltonian numbers in oriented graphs
- Spectral radius and \(k\)-connectedness of a graph
- The number of edges, spectral radius and Hamilton-connectedness of graphs
- Hamiltonian jump graphs
- On Hamiltonian colorings of graphs
- On a generalization of Chvátal's condition giving new Hamiltonian degree sequences
- A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
- A new proof of Wojcicka's conjecture
- Hamilton-connectivity of 3-domination critical graphs with \(\alpha = \delta + 2\)
- New sufficient conditions for bipancyclic bipartite graphs
- On the structure of the set of cycle lengths in a Hamiltonian graph
- Hamiltonian degree conditions for tough graphs
- Two vertex-disjoint cycles in a graph
- Degree sequences and the existence of k-factors
- A vertex cover with chorded 4-cycles
- The Hamiltonian numbers in digraphs
- Signless Laplacian spectral conditions for Hamilton-connected graphs with large minimum degree
- Spectral results on Hamiltonian problem
- Hamiltonian spectra of graphs
- Maximizing the number of cliques in graphs with given matching number
- Spectral analogues of Erdős' theorem on Hamilton-connected graphs
- On sufficient topological indices conditions for properties of graphs
- Wiener index, Harary index and graph properties
- Closure and spanning trees with bounded total excess
- Turán problems for Berge-\((k, p)\)-fan hypergraph
- Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs
- A generalization of a theorem of Nash-Williams
- Further results on the generalized Turán number of spanning linear forests
- Improved sufficient conditions for \(k\)-leaf-connected graphs
- Computing first and second fuzzy Zagreb indices of linear and multiacyclic hydrocarbons
- The Turán number of Berge-matching in hypergraphs
- More aspects of arbitrarily partitionable graphs
- Minimum degree conditions for the strength and bandwidth of graphs
- Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
- Sufficient conditions for graphs to be spanning connected
- On hyper-Hamiltonicity in graphs
- The formula for Turán number of spanning linear forests
- On sufficient spectral radius conditions for Hamiltonicity of \(k\)-connected graphs
- Extremal problems on distance spectra of graphs
- Unified spectral Hamiltonian results of balanced bipartite graphs and complementary graphs
- Hamilton-connected Mycielski \(\mathrm{graphs}^\ast\)
- Generalizations of the classics to spanning connectedness
- Closure operation for even factors on claw-free graphs
- Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable
- The shifting method and generalized Turán number of matchings
- Energy conditions for Hamiltonicity of graphs
- Signless Laplacian spectral conditions for Hamiltonicity of graphs
- Improved sufficient conditions for Hamiltonian properties
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)
