Claw-free graphs---a survey
type: Item
instance of: scholarly article
title: Claw-free graphs---a survey
zbMATH Open document ID: 0879.05043
DOI: 10.1016/S0012-365X(96)00045-3
author: Evelyne Flandrin
author: Zdeněk Ryjáček
author: Ralph Faudree
published in: Discrete Mathematics
publication date: 1997-07-13T00:00:00Z
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05-02
zbMATH DE Number: 1019056
zbMATH Keywords: survey
zbMATH Keywords: claw-free graphs
zbMATH Keywords: cycles
zbMATH Keywords: hamiltonicity
zbMATH Keywords: factors
zbMATH Keywords: domination
zbMATH Keywords: invariants
zbMATH Keywords: extremal problems
MaRDI profile type: Publication
Wikidata QID: Q55952667
cites work: Quasi-claw-free graphs
cites work: Q3201099
cites work: Factors and factorizations of graphs—a survey
cites work: On domination and independent domination numbers of a graph
cites work: The monotone circuit complexity of Boolean functions
cites work: On graphs satisfying a local ore-type condition
cites work: Some localization theorems on Hamiltonian circuits
cites work: Q3781786
cites work: Dominating cycles in bipartite biclaw-free graphs
cites work: Hamiltonian properties of graphs with large neighborhood unions
cites work: A generalization of Fan's condition for Hamiltonicity, pancyclicity, and Hamiltonian connectedness
cites work: Q5570136
cites work: Characterizations of derived graphs
cites work: The edge Hamiltonian path problem is NP-complete
cites work: Graph-theoretic parameters concerning domination, independence, and irredundance
cites work: Q4871748
cites work: Q5422499
cites work: Q3781785
cites work: Existence of Δλ-cycles and Δλ-paths
cites work: Long paths and cycles in tough graphs
cites work: Cycles through particular subgraphs of claw‐free graphs
cites work: Toughness and hamiltonicity in almost claw-free graphs
cites work: 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
cites work: Q3211339
cites work: A note on \(K_ 4\)-closures in hamiltonian graph theory
cites work: A note on locally connected and Hamiltonian-connected graphs
cites work: Q5677528
cites work: Hamiltonicity for K1, r‐free graphs
cites work: Hamilton cycle and dominating cycle in \(k\)-connected claw-free graphs
cites work: Q4030533
cites work: CHROMATIC BOUNDS FOR A CLASS OF GRAPHS
cites work: Regular factors in K1,3‐free graphs
cites work: Q3972308
cites work: Tough graphs and Hamiltonian circuits.
cites work: Which claw-free graphs are perfectly orderable?
cites work: A note on Hamiltonian circuits
cites work: Recognizing claw-free perfect graphs
cites work: Q3958496
cites work: Q4030543
cites work: Stability number of bull- and chair-free graphs
cites work: Q3741646
cites work: On the chromatic number of a graph with two forbidden subgraphs
cites work: Q3918148
cites work: Paths, Trees, and Flowers
cites work: Regular factors in K1,n free graphs
cites work: Claw‐free graphs are edge reconstructible
cites work: Q4873826
cites work: Generalized degree conditions for graphs with bounded independence number
cites work: Degree conditions and cycle extendability
cites work: On independent generalized degrees and independence numbers in \(K(1,m)\)- free graphs
cites work: Q3363384
cites work: Q4862340
cites work: Stability, domination and irredundance in a graph
cites work: Q4882984

Claw-free graphs---a survey (cites work)
cites work: Q3691779

Claw-free graphs---a survey (cites work)
cites work: On Hamiltonian claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Hamiltonicity of bipartite biclaw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Pancyclism in hamiltonian graphs

Claw-free graphs---a survey (cites work)
cites work: Q3826604

Claw-free graphs---a survey (cites work)
cites work: Hamiltonism, degree sum and neighborhood intersections

Claw-free graphs---a survey (cites work)
cites work: Mengerian properties, hamiltonicity, and claw‐free graphs

Claw-free graphs---a survey (cites work)
cites work: Q5749316

Claw-free graphs---a survey (cites work)
cites work: A strengthening of Ben Rebea's lemma

Claw-free graphs---a survey (cites work)
cites work: A new sufficient condition for hamiltonian graphs

Claw-free graphs---a survey (cites work)
cites work: A note on the characterization of domination perfect graphs

Claw-free graphs---a survey (cites work)
cites work: On claw-freeM-oriented critical kernel-imperfect digraphs

Claw-free graphs---a survey (cites work)
cites work: Q3826590

Claw-free graphs---a survey (cites work)
cites work: A Characterization of Comparability Graphs and of Interval Graphs

Claw-free graphs---a survey (cites work)
cites work: On stable set polyhedra for K//(1,3)free graphs

Claw-free graphs---a survey (cites work)
cites work: Q3218158

Claw-free graphs---a survey (cites work)
cites work: Q4713091

Claw-free graphs---a survey (cites work)
cites work: Sufficient conditions for a graph to be Hamiltonian

Claw-free graphs---a survey (cites work)
cites work: Updating the hamiltonian problem—A survey

Claw-free graphs---a survey (cites work)
cites work: Forbidden subgraphs and Hamiltonian properties and graphs

Claw-free graphs---a survey (cites work)
cites work: Forbidden subgraphs and hamiitonian properties in the square of a connected graph

Claw-free graphs---a survey (cites work)
cites work: On the numbers of independent \(k\)-sets in a claw free graph

Claw-free graphs---a survey (cites work)
cites work: Stability in CAN-free graphs

Claw-free graphs---a survey (cites work)
cites work: The struction of a graph: Application to CN-free graphs

Claw-free graphs---a survey (cites work)
cites work: Trees with Hamiltonian square

Claw-free graphs---a survey (cites work)
cites work: Q3815322

Claw-free graphs---a survey (cites work)
cites work: The square of a connected S(K1,3)-free graph is vertex pancyclic

Claw-free graphs---a survey (cites work)
cites work: Extending cycles in graphs

Claw-free graphs---a survey (cites work)
cites work: On the stability number of AH‐free graphs

Claw-free graphs---a survey (cites work)
cites work: How To Color Claw-Free Perfect Graphs

Claw-free graphs---a survey (cites work)
cites work: Algorithms for minimum covering by cliques and maximum clique in claw- free perfect graphs

Claw-free graphs---a survey (cites work)
cites work: A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

Claw-free graphs---a survey (cites work)
cites work: Q5184940

Claw-free graphs---a survey (cites work)
cites work: Q4887685

Claw-free graphs---a survey (cites work)
cites work: Hamilton cycles in regular 2-connected graphs

Claw-free graphs---a survey (cites work)
cites work: Q4326197

Claw-free graphs---a survey (cites work)
cites work: Q4014627

Claw-free graphs---a survey (cites work)
cites work: Note on Choudum's “chromatic bounds for a class of graphs”

Claw-free graphs---a survey (cites work)
cites work: The NP-completeness column: an ongoing guide

Claw-free graphs---a survey (cites work)
cites work: Q4088847

Claw-free graphs---a survey (cites work)
cites work: On partitioning the edges of graphs into connected subgraphs

Claw-free graphs---a survey (cites work)
cites work: Connected, locally 2-connected,K1,3-free graphs are panconnected

Claw-free graphs---a survey (cites work)
cites work: On the Cube of a Graph

Claw-free graphs---a survey (cites work)
cites work: On the chromatic index of multigraphs without large triangles

Claw-free graphs---a survey (cites work)
cites work: Applications of edge coloring of multigraphs to vertex coloring of graphs

Claw-free graphs---a survey (cites work)
cites work: Some applications of Vizing's theorem to vertex colorings of graphs

Claw-free graphs---a survey (cites work)
cites work: The chromatic number of graphs which induce neither \(K_{1,3}\) nor \(K_ 5-e\)

Claw-free graphs---a survey (cites work)
cites work: Q5286018

Claw-free graphs---a survey (cites work)
cites work: A note on the edge-reconstruction of \(K_{1,m}\)-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q4074931

Claw-free graphs---a survey (cites work)
cites work: Q4879721

Claw-free graphs---a survey (cites work)
cites work: Hamiltonian cycles in 2‐connected claw‐free‐graphs

Claw-free graphs---a survey (cites work)
cites work: Hamiltonicity in 2-connected graphs with claws

Claw-free graphs---a survey (cites work)
cites work: Q3491603

Claw-free graphs---a survey (cites work)
cites work: Q4030544

Claw-free graphs---a survey (cites work)
cites work: Q4030547

Claw-free graphs---a survey (cites work)
cites work: Hamiltonian cycles in 3‐connected claw‐free graphs

Claw-free graphs---a survey (cites work)
cites work: Longest cycles in regular 2-connected claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Hamiltonicity in \(2\)-connected claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: On pancyclic claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q4030562

Claw-free graphs---a survey (cites work)
cites work: Q3734438

Claw-free graphs---a survey (cites work)
cites work: Factors of claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q3320435

Claw-free graphs---a survey (cites work)
cites work: Matching theory

Claw-free graphs---a survey (cites work)
cites work: Q4304374

Claw-free graphs---a survey (cites work)
cites work: Disjoint cycles in star-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q3773909

Claw-free graphs---a survey (cites work)
cites work: Q3829576

Claw-free graphs---a survey (cites work)
cites work: Hamiltonian results inK1,3-free graphs

Claw-free graphs---a survey (cites work)
cites work: Longest paths and cycles in K1,3-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q3665799

Claw-free graphs---a survey (cites work)
cites work: On maximal independent sets of vertices in claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Some sufficient conditions for the existence of a 1-factor

Claw-free graphs---a survey (cites work)
cites work: On the existence of 1-factors in partial squares of graphs

Claw-free graphs---a survey (cites work)
cites work: Q3988774

Claw-free graphs---a survey (cites work)
cites work: Every connected, locally connected nontrivial graph with no induced claw is hamiltonian

Claw-free graphs---a survey (cites work)
cites work: Paw-free graphs

Claw-free graphs---a survey (cites work)
cites work: The strong perfect graph conjecture for pan-free graphs

Claw-free graphs---a survey (cites work)
cites work: The strong perfect-graph conjecture is true for \(K_{1,3}\)-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q3812277

Claw-free graphs---a survey (cites work)
cites work: Q4770411

Claw-free graphs---a survey (cites work)
cites work: Q3469132

Claw-free graphs---a survey (cites work)
cites work: Extending matchings in claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q4025529

Claw-free graphs---a survey (cites work)
cites work: Q3348939

Claw-free graphs---a survey (cites work)
cites work: Hamiltonian circuits in N2‐locally connected K1,3‐free graphs

Claw-free graphs---a survey (cites work)
cites work: Almost claw‐free graphs

Claw-free graphs---a survey (cites work)
cites work: Hamiltonicity in claw-free graphs through induced bulls

Claw-free graphs---a survey (cites work)
cites work: Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé

Claw-free graphs---a survey (cites work)
cites work: Q3976638

Claw-free graphs---a survey (cites work)
cites work: Local properties of graphs

Claw-free graphs---a survey (cites work)
cites work: Q5728984

Claw-free graphs---a survey (cites work)
cites work: Hamiltonicity in claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Q4940092

Claw-free graphs---a survey (cites work)
cites work: 2‐neighborhoods and hamiltonian conditions

Claw-free graphs---a survey (cites work)
cites work: Forbidden induced subgraphs for line graphs

Claw-free graphs---a survey (cites work)
cites work: Q4022066

Claw-free graphs---a survey (cites work)
cites work: Graphs with 1-Factors

Claw-free graphs---a survey (cites work)
cites work: 1-Factors and Antifactor Sets

Claw-free graphs---a survey (cites work)
cites work: Q3932997

Claw-free graphs---a survey (cites work)
cites work: Reflections on graph theory

Claw-free graphs---a survey (cites work)
cites work: Q5288887

Claw-free graphs---a survey (cites work)
cites work: On graphs with equal domination and independent domination numbers

Claw-free graphs---a survey (cites work)
cites work: Existence of dominating cycles and paths

Claw-free graphs---a survey (cites work)
cites work: Q4030546

Claw-free graphs---a survey (cites work)
cites work: The binding number of a graph and its Anderson number

Claw-free graphs---a survey (cites work)
cites work: Q4945895

Claw-free graphs---a survey (cites work)
cites work: Hamilton cycles in claw-free graphs

Claw-free graphs---a survey (cites work)
cites work: Cycles of given length in some \(K_{1,3}\)-free graphs

Claw-free graphs---a survey (cites work)
cites work: A necessary and sufficient condition for connected, locally k-connected k1,3-free graphs to be k-hamiltonian

Claw-free graphs---a survey (cites work)
cites work: A characterization of domination perfect graphs

Claw-free graphs---a survey (cites work)
cites work: On hamiltonian line graphs and connectivity

Claw-free graphs---a survey (full work available at URL)
full work available at URL: s0012-365x(96)00045-3

Claw-free graphs---a survey (OpenAlex ID)
OpenAlex ID: W2092366448