2‐neighborhoods and hamiltonian conditions
From MaRDI portal
Publication:4013430
Recommendations
Cites work
Cited in
(50)- scientific article; zbMATH DE number 1865919 (Why is no real title available?)
- scientific article; zbMATH DE number 1786081 (Why is no real title available?)
- scientific article; zbMATH DE number 7771746 (Why is no real title available?)
- Neighborhood conditions for graphs with induced claws
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Large degree vertices in longest cycles of graphs. I
- scientific article; zbMATH DE number 1782180 (Why is no real title available?)
- Cycles through subsets with large degree sums
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Claw-free graphs---a survey
- Large degree vertices in longest cycles of graphs. II
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
- An implicit degree condition for cyclability in graphs
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- A look at cycles containing specified elements of a graph
- The effects of distance and neighborhood union conditions on hamiltonian properties in graphs
- Degree conditions and degree bounded trees
- Degree sum conditions for cyclability in bipartite graphs
- Degree Conditions and Degree Bounded Trees
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Hamilton cycles in claw-heavy graphs
- A degree condition for cycles passing through specified vertices and edges
- A \(k\)-tree containing specified vertices
- Cycles through prescribed vertices with large degree sum
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Quasi-claw-free graphs
- Subgraphs, closures and hamiltonicity
- Partial degree conditions and cycle coverings in bipartite graphs
- Partial Degree Conditions and Cycle Coverings
- Hamilton cycles in almost distance-hereditary graphs
- Dirac's minimum degree condition restricted to claws
- A sufficient condition for cyclability in directed graphs
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
- Cycles through given vertices and closures
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- \(Z_3\)-connectivity of claw-free graphs
- Partial degrees on matchings for cycles in bipartite graphs
- On degree sum conditions for long cycles and cycles through specified vertices
- 20‐relative neighborhood graphs are hamiltonian
- A degree sum condition concerning the connectivity and the independence number of a graph
- Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
- An implicit degree sum condition for cycles through specified vertices
- Extensions and consequences of Chvátal-Erdös' theorem
- Long paths with endpoints in given vertex-subsets of graphs
- The cycle spectrum of claw-free Hamiltonian graphs
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
This page was built for publication: 2‐neighborhoods and hamiltonian conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4013430)
