2‐neighborhoods and hamiltonian conditions
From MaRDI portal
Publication:4013430
DOI10.1002/jgt.3190160310zbMath0761.05066OpenAlexW2114836722MaRDI QIDQ4013430
Publication date: 27 September 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160310
Related Items
\(Z_3\)-connectivity of claw-free graphs ⋮ Subgraphs, closures and hamiltonicity ⋮ Large degree vertices in longest cycles of graphs. I ⋮ Heavy subgraph conditions for longest cycles to be heavy in graphs ⋮ Minimum implicit degree condition restricted to claws for Hamiltonian cycles ⋮ Hamilton cycles in almost distance-hereditary graphs ⋮ Dirac's minimum degree condition restricted to claws ⋮ Claw-free graphs---a survey ⋮ Cycles through prescribed vertices with large degree sum ⋮ Cycles through subsets with large degree sums ⋮ Degree sum conditions for cyclability in bipartite graphs ⋮ A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs ⋮ Quasi-claw-free graphs ⋮ A \(k\)-tree containing specified vertices ⋮ A sufficient condition for cyclability in directed graphs ⋮ Partial degree conditions and cycle coverings in bipartite graphs ⋮ Extensions and consequences of Chvátal-Erdös' theorem ⋮ An implicit degree sum condition for cycles through specified vertices ⋮ Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey ⋮ Disjoint cycles covering specified vertices in bipartite graphs with partial degrees ⋮ A degree condition for cycles passing through specified vertices and edges ⋮ Degree conditions for the existence of vertex-disjoint cycles and paths: a survey ⋮ Unnamed Item ⋮ Cycles through given vertices and closures ⋮ Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity ⋮ Long paths with endpoints in given vertex-subsets of graphs ⋮ An Implicit Degree Condition for Cyclability in Graphs ⋮ Unnamed Item ⋮ Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs ⋮ Set-orderedness as a generalization of \(k\)-orderedness and cyclability ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws† ⋮ On degree sum conditions for long cycles and cycles through specified vertices ⋮ The cycle spectrum of claw-free Hamiltonian graphs ⋮ A degree sum condition concerning the connectivity and the independence number of a graph ⋮ Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem ⋮ Hamilton cycles in claw-heavy graphs ⋮ Degree conditions and degree bounded trees ⋮ Partial Degree Conditions and Cycle Coverings ⋮ A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph ⋮ A look at cycles containing specified elements of a graph ⋮ Neighborhood conditions for graphs with induced claws ⋮ Large degree vertices in longest cycles of graphs II ⋮ Forbidden subgraphs for longest cycles to contain vertices with large degrees ⋮ Degree Conditions and Degree Bounded Trees
Cites Work
This page was built for publication: 2‐neighborhoods and hamiltonian conditions
