On Hamilton's ideals
From MaRDI portal
Publication:2545100
DOI10.1016/0095-8956(72)90020-2zbMath0213.50803OpenAlexW2000934872MaRDI QIDQ2545100
Publication date: 1972
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(72)90020-2
Related Items
Spectral conditions for traceability of connected claw-free graphs, Monochromatic Cycles in 2-Coloured Graphs, Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs, Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree, On deficiency problems for graphs, Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem, Unnamed Item, Spanning Cycles Through Specified Edges in Bipartite Graphs, A Degree Sequence Strengthening of the Vertex Degree Threshold for a Perfect Matching in 3-Uniform Hypergraphs, A class of Hamiltonian regular graphs, On sufficient spectral radius conditions for Hamiltonicity, Maximal sets of Hamilton cycles inKn,n, Transversals and bipancyclicity in bipartite graph families, Cycles of many lengths in Hamiltonian graphs, On sufficient conditions for spanning structures in dense graphs, Two disjoint cycles in digraphs, Rainbow structures in a collection of graphs with degree conditions, Sufficient spectral conditions for graphs being k-edge-Hamiltonian or k-Hamiltonian, 2-Trees: Structural insights and the study of Hamiltonian paths, Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022, The maximum number of cliques in graphs with prescribed order, circumference and minimum degree, On sufficient conditions for Hamiltonicity of graphs, and beyond, A closure lemma for tough graphs and Hamiltonian degree conditions, Distance signless Laplacian spectral radius and Hamiltonian properties of graphs, On Degree Sequences Forcing The Square of a Hamilton Cycle, A Rainbow Dirac's Theorem, Toughness and binding number, Graphs and degree sequences. I, COMPARISON OF SUFFICIENT DEGREE BASED CONDITIONS FOR HAMILTONIAN GRAPH, Embedding Spanning Bipartite Graphs of Small Bandwidth, Sufficient conditions for Hamiltonian graphs in terms of (signless Laplacian) spectral radius, Unnamed Item, Toughness and Vertex Degrees, Homopolar circuits in polar graphs, Some recent results in hamiltonian graphs, On mutually independent Hamiltonian paths, Toughness in graphs -- a survey, Tough graphs and Hamiltonian circuits. (Reprint), Sufficient degree conditions fork-edge-connectedness of a graph, Some topological indices and graph properties, Anti-Ramsey Problems for t Edge-Disjoint Rainbow Spanning Subgraphs: Cycles, Matchings, or Trees, On certain cycles in graphs, Spectral radius and Hamiltonian properties of graphs, Spectral radius and Hamiltonicity of graphs with large minimum degree, Hamiltonian lines in infinite graphs with few vertices of smll valency, Note on Hamilton circuits and Hamilton paths, Tough graphs and Hamiltonian circuits., The strongest monotone degree condition for \(n\)-connectedness of a graph, On a Goodman – Hedetniemi Sufficient Condition for the Graph Hamiltonicity, Degree sequences forcing Hamilton cycles in directed graphs, On the necessity of Chvátal’s Hamiltonian degree condition, Wiener-type invariants on graph properties, On hyper-Zagreb index conditions for hamiltonicity of graphs, A note on the edge reconstruction conjecture, Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants, Subgraphs intersecting any Hamiltonian cycle, Hamiltonian threshold graphs, A cycle structure theorem for Hamiltonian graphs, The edge-chromatic class of regular graphs of degree 4 and their complements, Longest cycles in threshold graphs, Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday), The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\), Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs, Hamiltonian degree conditions for tough graphs, On a degree sequence analogue of Pósa's conjecture, Stability in the Erdős-Gallai theorems on cycles and paths, A note on the computation on the k-closure of a graph, Vertex-splitting and chromatic index critical graphs, Scattering number and extremal non-Hamiltonian graphs, Vertex arboricity and vertex degrees, Hamiltonian cycles in critical graphs with large maximum degree, Monochromatic cycle partitions of graphs with large minimum degree, Random interval graphs, Monochromatic Hamiltonian Berge-cycles in colored hypergraphs, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, A new Chvátal type condition for pancyclicity, On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences, Sufficient conditions for graphs to be spanning connected, Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey, Degree sequences and the existence of \(k\)-factors, Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor, Pancyclic graphs and a conjecture of Bondy and Chvatal, Degree sequences and edge connectivity, A sufficient condition for the existence of an anti-directed 2-factor in a directed graph, New Ore's type results on hamiltonicity and existence of paths of given length in graphs, A survey on Hamilton cycles in directed graphs, Cycle lengths of Hamiltonian \(P_\ell\)-free graphs, A degree sequence version of the Kühn-Osthus tiling theorem, Minimum graphs with complete k-closure, Hamiltonicity and combinatorial polyhedra, Completion and deficiency problems, The chromatic index of multigraphs that are nearly full, Hamiltonian degree conditions which imply a graph is pancyclic, Best monotone degree conditions for binding number, Cycle spectra of Hamiltonian graphs, Stability in the Erdős-Gallai theorem on cycles and paths. II, Spectral radius and Hamiltonian graphs, Star-critical Ramsey numbers involving graphs with long suspended paths, Covering the vertices of a digraph by cycles of prescribed length, Graph vulnerability parameters, compression, and threshold graphs, Stable properties of graphs, Sufficient spectral conditions on Hamiltonian and traceable graphs, Best monotone degree conditions for graph properties: a survey, Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\), Best monotone degree conditions for binding number and cycle structure, On Hamiltonian cycles in balanced \(k\)-partite graphs, Resolving the Hamiltonian problem for vertex-transitive graphs of order a product of two primes, Spectral radius and \(k\)-connectedness of a graph, Generalizations of the classics to spanning connectedness, On Ore-type sufficient condition for a bipancyclic ordering, A condition for a Hamiltonian bipartite graph to be bipancyclic, The chromatic index of a graph whose core has maximum degree two, Applying a condition for a Hamiltonian bipartite graph to be bipancyclic, Recent results on the total chromatic number, On existence theorems, Computation of the 0-dual closure for hamiltonian graphs, Spectral conditions for some graphical properties, Hamiltonian property of the incidence graphs of quadrangles associated with symplectic forms on finite fields, Hamiltonian degree sequences in digraphs, Sufficient conditions for a graph to be Hamiltonian, A variation of the Erdős-Sós conjecture in bipartite graphs, On n-Hamiltonian graphs, On a generalization of Chvátal's condition giving new Hamiltonian degree sequences, A method in graph theory, Sur les arborescences dans un graphe oriente, Panconnected graphs. II, Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs, On sufficient topological indices conditions for properties of graphs, On the generating graphs of symmetric groups, Wiener index, Harary index and graph properties, Spectral conditions for graphs to be \(k\)-Hamiltonian or \(k\)-path-coverable, The hamiltonian index of a 2-connected graph, Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences, On Hamiltonian cycles in hypergraphs with dense link graphs, Long monochromatic paths and cycles in 2-edge-colored multipartite graphs, Sufficient spectral radius conditions for Hamilton-connectivity of \(k\)-connected graphs, Mutually orthogonal Hamiltonian connected graphs, Hamilton cycles and paths in vertex-transitive graphs-current directions, Coprime ordering of cyclic planar difference sets, Stability results on the circumference of a graph, Anti-Ramsey problems in complete bipartite graphs for \(t\) edge-disjoint rainbow spanning subgraphs: cycles and matchings, Hamiltonian arcs in self-complementary graphs, Signless Laplacian spectral conditions for Hamiltonicity of graphs, Spectral radius and the 2-power of Hamilton cycle, The maximum size of a nonhamiltonian graph with given order and connectivity, Locally pancyclic graphs, Two theorems on Hamiltonian graphs, New sufficient conditions for cycles in graphs, A generalization of a theorem of Nash-Williams, Wheel and star-critical Ramsey numbers for quadrilateral, Spectral condition for Hamiltonicity of a graph, A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected, A degree sequence Hajnal-Szemerédi theorem, Degree maximal graphs are Laplacian integral
Cites Work
