Hamiltonicity of claw-free graphs and Fan-type conditions
type: Item
instance of: scholarly article
title: Hamiltonicity of claw-free graphs and Fan-type conditions
zbMATH Open document ID: 1405.05093
author: Zhi-Hong Chen
published in: Discrete Mathematics
publication date: 2019-02-20T00:00:00Z
Mathematics Subject Classification ID: 05C45
zbMATH DE Number: 7027167
zbMATH Keywords: Hamiltonicity
zbMATH Keywords: obstruction set
zbMATH Keywords: claw-free graph
zbMATH Keywords: Catlin's reduction method
zbMATH Keywords: Fan-type condition
MaRDI profile type: Publication
full work available at URL: j.disc.2018.12.008
OpenAlex ID: W2910300564
cites work: Quasi-claw-free graphs
cites work: Q5422499
cites work: A reduction method to find spanning Eulerian subgraphs
cites work: Graphs without spanning closed trails
cites work: Chvátal-Erdős type conditions for Hamiltonicity of claw-free graphs
cites work: Degree and neighborhood conditions for Hamiltonicity of claw-free graphs
cites work: Hamiltonicity and Degrees of Adjacent Vertices in Claw‐Free Graphs
cites work: Q5740779
cites work: Eulerian subgraphs in 3‐edge‐connected graphs and Hamiltonian line graphs
cites work: Some Theorems on Abstract Graphs
cites work: New sufficient conditions for cycles in graphs
cites work: On Eulerian and Hamiltonian Graphs and Line Graphs
cites work: Note on Hamilton Circuits
cites work: A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
cites work: Almost claw‐free graphs
cites work: On a closure concept in claw-free graphs
cites work: On dominating and spanning circuits in graphs
cites work: Minimum degree conditions for the Hamiltonicity of 3-connected claw-free graphs
DOI: 10.1016/J.DISC.2018.12.008
Wikidata QID: Q128616252
description: scientific article; zbMATH DE number 7027167