A method in graph theory
From MaRDI portal
Publication:1227760
DOI10.1016/0012-365X(76)90078-9zbMath0331.05138OpenAlexW2000467025WikidataQ115188650 ScholiaQ115188650MaRDI QIDQ1227760
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90078-9
Related Items (only showing first 100 items - show all)
Vertex pancyclic graphs ⋮ Subgraphs intersecting any Hamiltonian cycle ⋮ Subgraphs, closures and hamiltonicity ⋮ On k-leaf-connected graphs ⋮ Semi-independence number of a graph and the existence of Hamiltonian circuits ⋮ On one extension of Dirac's theorem on Hamiltonicity ⋮ A generalization of a result of Häggkvist and Nicoghossian ⋮ On the computational complexity of graph closures ⋮ Dirac's minimum degree condition restricted to claws ⋮ Stability in the Erdős-Gallai theorems on cycles and paths ⋮ A note on the computation on the k-closure of a graph ⋮ Cycles through subsets with large degree sums ⋮ Scattering number and extremal non-Hamiltonian graphs ⋮ Generalization of matching extensions in graphs. IV: Closures ⋮ Hamiltonian cycles in critical graphs with large maximum degree ⋮ Degree conditions for Hamiltonicity: counting the number of missing edges ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ 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 ⋮ Extending cycles in bipartite graphs ⋮ Connected graph \(G\) with \(\sigma_2(G) \geq \frac{2}{3} n\) and \(K_{1, 4}\)-free contains a Hamiltonian path ⋮ Neighbourhood unions and Hamiltonian properties in graphs ⋮ Edge bounds in nonhamiltonian \(k\)-connected graphs ⋮ Partition of a directed bipartite graph into two directed cycles ⋮ Subdivision extendibility ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Hamiltonian numbers in oriented graphs ⋮ All complete graph-wheel planar Ramsey numbers ⋮ A new closure concept preserving graph Hamiltonicity and based on neighborhood equivalence ⋮ Minimum graphs with complete k-closure ⋮ Improved degree conditions for Hamiltonian properties ⋮ On a neighborhood condition implying the existence of disjoint complete graphs ⋮ Best monotone degree conditions for binding number ⋮ Implicit-degrees and circumferences ⋮ A catalogue of small maximal nonhamiltonian graphs ⋮ A short proof of a theorem about the circumference of a graph ⋮ Cycles through given vertices and closures ⋮ A note on computing graph closures ⋮ Some localization theorems on Hamiltonian circuits ⋮ Hamilton cycles in dense vertex-transitive graphs ⋮ Strong sufficient conditions for the existence of Hamiltonian circuits in undirected graphs ⋮ More powerful closure operations on graphs ⋮ \(\alpha\)-degree closures for graphs ⋮ Hamiltonism, degree sum and neighborhood intersections ⋮ Stable properties of graphs ⋮ Spanning trees: A survey ⋮ Spanning \(k\)-trees of \(n\)-connected graphs ⋮ How many conjectures can you stand? A survey ⋮ The generating graph of some monolithic groups. ⋮ Best monotone degree conditions for graph properties: a survey ⋮ The Ramsey numbers for stars of even order versus a wheel of order nine ⋮ Best monotone degree conditions for binding number and cycle structure ⋮ Spectral analogues of Moon-Moser's theorem on Hamilton paths in bipartite graphs ⋮ Spectral radius and \(k\)-connectedness of a graph ⋮ Dominating cycles in regular 3-connected graphs ⋮ The number of edges, spectral radius and Hamilton-connectedness of graphs ⋮ Partition of a bipartite graph into cycles ⋮ On existence theorems ⋮ Computation of the 0-dual closure for hamiltonian graphs ⋮ Spectral conditions for some graphical properties ⋮ Hamiltonian jump graphs ⋮ On protein structure alignment under distance constraint ⋮ On Hamiltonian colorings of graphs ⋮ A sufficient condition for Hamiltonian circuits ⋮ Graph theory (algorithmic, algebraic, and metric problems) ⋮ On the generating graphs of symmetric groups ⋮ A note on stable graphs ⋮ Degree conditions on induced claws ⋮ Collapsible graphs and Hamiltonicity of line graphs ⋮ Closure and spanning \(k\)-trees ⋮ Removable matchings and Hamiltonian cycles ⋮ Extending cycles in graphs ⋮ 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 ⋮ Closed trail decompositions of some classes of regular 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 ⋮ Berge cycles in non-uniform hypergraphs ⋮ Hamilton cycles and paths in vertex-transitive graphs-current directions ⋮ Hamiltonicity in vertex envelopes of plane cubic graphs ⋮ Stability results on the circumference of a graph ⋮ On the circumference of a graph and its complement ⋮ A generalization of Fan's condition and forbidden subgraph conditions for hamiltonicity ⋮ A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs ⋮ A generalization of the Bondy-Chvátal theorem on the k-closure ⋮ 9-connected claw-free graphs are Hamilton-connected ⋮ A note on \(K_ 4\)-closures in hamiltonian graph theory ⋮ Two theorems on Hamiltonian graphs ⋮ A closure concept based on neighborhood unions of independent triples ⋮ The maximum number of diagonals of a cycle in a block ⋮ Partition of a bipartite Hamiltonian graph into two cycles
Cites Work
This page was built for publication: A method in graph theory
