On Hamilton's ideals - MaRDI portal

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?)
Some Theorems on Abstract Graphs
A Short Proof of the Factor Theorem for Finite Graphs
On Hamiltonian bipartite graphs
n-Hamiltonian graphs
On Hamiltonian Circuits in Finite Graphs

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

Spectral condition for Hamiltonicity of a graph
The chromatic index of a graph whose core has maximum degree two
Toughness in graphs -- a survey
Tough graphs and Hamiltonian circuits.
Hamiltonian degree conditions for tough graphs
Signless Laplacian spectral conditions for Hamiltonicity of graphs
Degree sequences and the existence of \(k\)-factors
Pancyclic graphs and a conjecture of Bondy and Chvatal
Spectral radius and Hamiltonian graphs
Applying a condition for a Hamiltonian bipartite graph to be bipancyclic
Computation of the 0-dual closure for hamiltonian graphs
On existence theorems
Recent results on the total chromatic number
Sufficient spectral conditions on Hamiltonian and traceable graphs
Some sufficient conditions for Hamiltonian property in terms of Wiener-type invariants
Locally pancyclic graphs
Spanning cycles through specified edges in bipartite graphs
A sufficient condition for the existence of an anti-directed 2-factor in a directed graph
Hamiltonian degree conditions which imply a graph is pancyclic
Scattering number and extremal non-Hamiltonian graphs
A class of Hamiltonian regular graphs
A condition for a Hamiltonian bipartite graph to be bipancyclic
Toughness and binding number
On mutually independent Hamiltonian paths
The strongest monotone degree condition for \(n\)-connectedness of a graph
Monochromatic cycle partitions of graphs with large minimum degree
Sufficient conditions for a graph to be Hamiltonian
New sufficient conditions for cycles in graphs
A degree sequence Hajnal-Szemerédi theorem
Wheel and star-critical Ramsey numbers for quadrilateral
Monochromatic cycle partitions of \(2\)-coloured graphs with minimum degree \(3n/4\)
On the generating graphs of symmetric groups
Hamiltonicity and combinatorial polyhedra
Hamilton cycles and paths in vertex-transitive graphs-current directions
Two theorems on Hamiltonian graphs
Mutually orthogonal Hamiltonian connected graphs
Extremal Theorems for Degree Sequence Packing and the Two-Color Discrete Tomography Problem
Hamiltonian threshold graphs
Resilient degree sequences with respect to Hamilton cycles and matchings in random graphs
Note on Hamilton circuits and Hamilton paths
Spectral radius and Hamiltonicity of graphs with large minimum degree
Panconnected graphs. II
Sur les arborescences dans un graphe oriente
A survey on Hamilton cycles in directed graphs
On a degree sequence analogue of Pósa's conjecture
Improved sufficient conditions for the existence of anti-directed Hamiltonian cycles in digraphs
Degree maximal graphs are Laplacian integral
Random interval graphs
On Degree Sequences Forcing The Square of a Hamilton Cycle
Hamiltonian cycles in critical graphs with large maximum degree
Vertex arboricity and vertex degrees
Monochromatic cycles in 2-coloured graphs
Hamiltonian degree sequences in digraphs
Best monotone degree conditions for graph properties: a survey
A method in graph theory
Stable properties of graphs
Cycle spectra of Hamiltonian graphs
Some recent results in hamiltonian graphs
Best monotone degree conditions for binding number and cycle structure
Spectral radius and \(k\)-connectedness of a graph
Stability in the Erdős-Gallai theorems on cycles and paths
Best monotone degree conditions for binding number
On sufficient spectral radius conditions for Hamiltonicity
The chromatic index of graphs with large even order \(n\) and minimum degree at least \(2n/3\)
A cycle structure theorem for Hamiltonian graphs
Anti-Ramsey problems for \(t\) edge-disjoint rainbow spanning subgraphs: cycles, matchings, or trees
Stability in the Erdős-Gallai theorem on cycles and paths. II
Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
On n-Hamiltonian graphs
Sufficient degree conditions fork-edge-connectedness of a graph
Toughness and Vertex Degrees
Spectral radius and Hamiltonian properties of graphs
Embedding Spanning Bipartite Graphs of Small Bandwidth
Degree sequences and edge connectivity
Best monotone degree condition for the Hamiltonicity of graphs with a 2-factor
Spectral conditions for some graphical properties
Reciprocal degree distance and Hamiltonian properties of graphs
Longest cycles in threshold graphs
A Rainbow Dirac's Theorem
Frequency partitions: Forcibly pancyclic and forcibly nonhamiltonian degree sequences
Graph vulnerability parameters, compression, and threshold graphs
Spectral conditions for traceability of connected claw-free graphs
Title not available (Why is that?)
Pósa-type results for Berge hypergraphs
A variation of the Erdős-Sós conjecture in bipartite graphs
A note on the computation on the k-closure of a graph
Title not available (Why is that?)
A new sufficient degree condition for a graphic sequence to be forcibly \(k\)-edge-connected
On the normalized Laplacian spectral radius of traceable graphs
The hamiltonian index of a 2-connected graph
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
Generalizations of the classics to spanning connectedness
Covering the vertices of a digraph by cycles of prescribed length
Hamiltonian property of the incidence graphs of quadrangles associated with symplectic forms on finite fields
Perfect matching in \(k\)-partite \(k\)-graphs and 3-uniform HM-bipartite hypergraphs
On sufficient topological indices conditions for properties of graphs
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree
Combinatorics, probability and computing. Abstracts from the workshop held April 24--30, 2022
Transversals and bipancyclicity in bipartite graph families
Chvátal-Erdős condition for pancyclicity

This page was built for publication: On Hamilton's ideals

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