A Generalization of Join and an Algorithmic Recognition Problem

DOI10.3233/FI-2016-1347zbMath1367.05179OpenAlexW2345881920MaRDI QIDQ4976419

M. A. Shalu, Yamini S. Devi

Publication date: 28 July 2017

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2016-1347

zbMATH Keywords

modular decompositionmaximum weight independent set problemmaximum weight clique problemminimum coloring problemodd hole-free graphs\(c^2\)-joinminimum clique cover problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22) Graph operations (line graphs, products, etc.) (05C76)

This page was built for publication: A Generalization of Join and an Algorithmic Recognition Problem