On the clique-width of ( 4 K₁ , C₄ , C₅ , C₇ )-free graphs

DOI10.1016/J.DAM.2020.07.009zbMATH Open1447.05158OpenAlexW3044776027MaRDI QIDQ2197487FDOQ2197487

Authors: Irena Penev 

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.07.009

Recommendations

• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Bounding the clique-width of \(H\)-free chordal graphs
• Fundamentals of Computation Theory

zbMATH Keywords

clique-widthforbidden induced subgraphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Upper bounds to the clique width of graphs
• Incidence matrices and interval graphs
• Clique-width for 4-vertex forbidden subgraphs
• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs

Cited In (2)

• Characterizations of \((4 K_1,C_4,C_5)\)-free graphs
• Cliques in \(C_4\)-free graphs of large minimum degree

This page was built for publication: On the clique-width of \(( 4 K_1 , C_4 , C_5 , C_7 )\)-free graphs

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