scientific article; zbMATH DE number 1753165

MaRDI QIDQ4533373zbMATH OpenFDO

Authors Luitpold Babel, Andreas Brandstädt, Van Bang Le

Publication date 26 September 2002

Full work available at URL https://eudml.org/doc/122067

zbMATH Keywords

\(P_4\)-structure\(p\)-connected graphsclaw-free graphshomogeneous setperfect graphsreconstruction problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2119686
• Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles
• Recognizing the \(P_4\)-structure of bipartite graphs
• Recognizing the \(P_4\)-structure of block graphs
• On the structure of graphs without claw, \(4K_1\) and co-R

Cited in

(11)

• Recognizing claw-free perfect graphs
• Bipartite-perfect graphs
• On 4-connected claw-free well-covered graphs
• On the structure of graphs without claw, \(4K_1\) and co-R
• The P₄-structure of perfect graphs
• Claw-free t-perfect graphs can be recognized in polynomial time
• On quadrilaterals and 4-path in claw-free graphs
• scientific article; zbMATH DE number 2119686 (Why is no real title available?)
• Some results on the reconstruction problems. p‐claw‐free, chordal, and p₄‐reducible graphs
• Structure of 4-connected claw-free graphs not containing a subdivision of \(K_{5}\)
• Claw-free \(t\)-perfect graphs can be recognised in polynomial time

This page was built for publication:

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