Graphs obtained by disjoint unions and joins of cliques and stable sets

DOI10.1051/RO/2024108MaRDI QIDQ6594038zbMATH OpenFDO

Authors Alain Hertz

Publication date 27 August 2024

Published in RAIRO. Operations Research (Search for Journal in Brave)

Copyright license File:Creative commons license with attribution.png Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1051/RO/2024108

zbMATH Keywords

cliquesdisjoint uniondominating setsjoin of graphsstable sets

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Combinatorial optimization (90C27)

Recommendations

• A class of threshold and domishold graphs: Equistable and equidominating graphs
• Dominoes
• On a class of graphs between threshold and total domishold graphs
• Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs
• On the problem of domino recognition

Cites work

• Characterizations for co-graphs defined by restricted NLC-width or clique-width operations
• scientific article; zbMATH DE number 3598234 (Why is no real title available?)
• Linear Separation of Dominating Sets in Graphs
• On a class of graphs between threshold and total domishold graphs
• On a property of the class of n-colorable graphs
• Square-Free Graphs with No Six-Vertex Induced Path

Cited in

(1)

• Dominoes

This page was built for publication: Graphs obtained by disjoint unions and joins of cliques and stable sets

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