Clique or hole in claw-free graphs

DOI10.1016/j.jctb.2011.02.004zbMath1237.05174OpenAlexW2052053238MaRDI QIDQ765186

Henning Bruhn, Akira Saito

Publication date: 19 March 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.02.004

zbMATH Keywords

holecliqueclawfree

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (2)

The (theta, wheel)-free graphs. IV: Induced paths and cycles ⋮ Induced Disjoint Paths in Claw-Free Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The three-in-a-tree problem
• Decomposition by clique separators
• An algorithm for finding clique cut-sets
• On the complexity of testing for odd holes and induced odd paths
• Corrigendum to: On the complexity of testing for odd holes and induced odd paths
• Circuits containing specified edges
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• Detecting induced subgraphs

This page was built for publication: Clique or hole in claw-free graphs