On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs

DOI10.1002/jgt.22749zbMath1522.05134OpenAlexW3204925672MaRDI QIDQ6057651

Irena Penev

Publication date: 5 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22749

zbMATH Keywords

graph coloringgraph algorithmsclique-widthgraph structureeven-hole-free graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Coloring \((4K_1,C_4,C_6)\)-free graphs

Cites Work

• MSOL partitioning problems on graphs of bounded treewidth and clique-width
• On diameters and radii of bridged graphs
• Decomposition of even-hole-free graphs with star cutsets and 2-joins
• The intersection of two vertex coloring problems
• A faster algorithm to recognize even-hole-free graphs
• Incidence matrices and interval graphs
• Clique-width for 4-vertex forbidden subgraphs
• Even-hole-free graphs part I: Decomposition theorem
• The world of hereditary graph classes viewed through Truemper configurations
• Even-hole-free graphs part II: Recognition algorithm
• A New Algorithm for Generating All the Maximal Independent Sets
• Algorithm Theory - SWAT 2004
• Clique‐cutsets beyond chordal graphs
• Even-hole-free graphs still have bisimplicial vertices
• Coloring rings

This page was built for publication: On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs