Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)

DOI10.1007/978-3-642-11409-0_29zbMath1273.05187OpenAlexW1575089356MaRDI QIDQ5851118

Michal Stern, Shimon Shrem, Martin Charles Golumbic

Publication date: 21 January 2010

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11409-0_29

zbMATH Keywords

triangle-free graphsclaw-free graphspolynomial-time algorithmsodd holes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Finding induced paths of given parity in claw-free graphs ⋮ The \(k\)-in-a-path problem for claw-free graphs ⋮ Finding a smallest odd hole in a claw-free graph using global structure ⋮ Unnamed Item ⋮ A faster algorithm to recognize even-hole-free graphs

This page was built for publication: Smallest Odd Holes in Claw-Free Graphs (Extended Abstract)