Clique or hole in claw-free graphs

DOI10.1016/J.JCTB.2011.02.004MaRDI QIDQ765186zbMATH OpenOpenAlexFDO

Authors 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

cliqueholeclawfree

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• The \(k\)-in-a-path problem for claw-free graphs
• The \(k\)-in-a-path problem for claw-free graphs
• Claw-free graphs. IV: Decomposition theorem
• Induced disjoint paths in claw-free graphs
• Cycles through particular subgraphs of claw‐free graphs

Cites work

• scientific article; zbMATH DE number 3685495 (Why is no real title available?)
• scientific article; zbMATH DE number 2203240 (Why is no real title available?)
• An algorithm for finding clique cut-sets
• Circuits containing specified edges
• Corrigendum to: On the complexity of testing for odd holes and induced odd paths
• Decomposition by clique separators
• On the complexity of testing for odd holes and induced odd paths
• One or two disjoint circuits cover independent edges. Lovász-Woodall conjecture
• The \(k\)-in-a-path problem for claw-free graphs
• The structure of claw-free graphs
• The three-in-a-tree problem

Cited in

(5)

• Finding a smallest odd hole in a claw-free graph using global structure
• Induced disjoint paths in claw-free graphs
• The (theta, wheel)-free graphs. IV: Induced paths and cycles
• Disjoint cliques in claw-free graphs
• Growing without cloning

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q765186)