2‐neighborhoods and hamiltonian conditions
From MaRDI portal
Publication:4013430
DOI10.1002/JGT.3190160310zbMATH Open0761.05066OpenAlexW2114836722MaRDI QIDQ4013430FDOQ4013430
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
Cites Work
Cited In (47)
- A degree sum condition for the existence of an \(S\)-path-system in a bipartite graph
- On degree sum conditions for long cycles and cycles through specified vertices
- Disjoint cycles covering specified vertices in bipartite graphs with partial degrees
- Large degree vertices in longest cycles of graphs II
- Partial degree conditions and cycle coverings in bipartite graphs
- Partial degrees on matchings for cycles in bipartite graphs
- Cycles through subsets with large degree sums
- Heavy subgraph conditions for longest cycles to be heavy in graphs
- Large degree vertices in longest cycles of graphs. I
- Title not available (Why is that?)
- Set-orderedness as a generalization of \(k\)-orderedness and cyclability
- Cycles through prescribed vertices with large degree sum
- A generalization of Dirac's theorem on cycles through \(k\) vertices in \(k\)-connected graphs
- Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity
- Cycles through given vertices and closures
- 20‐relative neighborhood graphs are hamiltonian
- Hamiltonian cycles and 2-dominating induced cycles in claw-free graphs
- Long paths with endpoints in given vertex-subsets of graphs
- Claw-free graphs---a survey
- Extensions and consequences of Chvátal-Erdös' theorem
- Title not available (Why is that?)
- Minimum implicit degree condition restricted to claws for Hamiltonian cycles
- A degree condition for cycles passing through specified vertices and edges
- Hamiltonian cycle in almost distance-hereditary graphs with degree condition restricted to claws†
- A \(k\)-tree containing specified vertices
- Quasi-claw-free graphs
- Hamilton cycles in almost distance-hereditary graphs
- A look at cycles containing specified elements of a graph
- Partial Degree Conditions and Cycle Coverings
- Degree conditions and degree bounded trees
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- Hamilton cycles in claw-heavy graphs
- Forbidden subgraphs for longest cycles to contain vertices with large degrees
- Dirac's minimum degree condition restricted to claws
- Degree sum conditions for cyclability in bipartite graphs
- A sufficient condition for cyclability in directed graphs
- Degree Conditions and Degree Bounded Trees
- \(Z_3\)-connectivity of claw-free graphs
- Cycles through large degree vertices in digraphs: A generalization of Meyniel's theorem
- An implicit degree sum condition for cycles through specified vertices
- A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
- A degree sum condition concerning the connectivity and the independence number of a graph
- Generalizations of Dirac's theorem in Hamiltonian graph theory -- a survey
- Subgraphs, closures and hamiltonicity
- The cycle spectrum of claw-free Hamiltonian graphs
- Neighborhood conditions for graphs with induced claws
- An Implicit Degree Condition for Cyclability in 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)
