Abstract
A graph that can be generated from \(K_1\) using joins and 0-sums is called a cograph. We define a sesquicograph to be a graph that can be generated from \(K_1\) using joins, 0-sums, and 1-sums. We show that, like cographs, sesquicographs are closed under induced minors. Cographs are precisely the graphs that do not have the 4-vertex path as an induced subgraph. We obtain an analogue of this result for sesquicographs, that is, we find those non-sesquicographs for which every proper induced subgraph is a sesquicograph.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Data Availability
All data generated or analysed during this study are included in this published article.
References
Corneil, D.G., Lerchs, H., Stewart Burlingham, L.: Complement reducible graphs. Disc. Appl. Math. 3, 163–174 (1981)
Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition for cographs. SIAM J. Comput. 14, 926–934 (1985)
Diestel, R.: Graph Theory, 3rd edn. Springer, Berlin (2005)
Jung, H.A.: On a class of posets and the corresponding comparability graphs. J. Combin. Theory Ser. B 24, 125–133 (1978)
McKay, B.D., Piperno, A.: Practical graph isomorphism II. J. Symb. Comput. 60, 94–112 (2014)
Nebesky, L.: On induced subgraphs of a block. J. Graph Theory 1, 69–74 (1977)
Oxley, J., Singh, J.: Generalizing cographs to 2-cographs (submitted). arxiv:2103.00403
SageMath: The Sage Mathematics Software System (Version 8.2). The Sage Developers (2019). http://www.sagemath.org
Seinsche, D.: On a property of the class of \(n\)-colourable graphs. J. Combin. Theory Ser. B 16, 191–193 (1974)
West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)
Acknowledgements
The author thanks James Oxley for helpful suggestions. The author also thanks Thomas Zaslavsky for helpful discussions.
Funding
The author declares that no funds or grants were received during the preparation of this manuscript.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The author has no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Singh, J. Cographs and 1-Sums. Graphs and Combinatorics 40, 2 (2024). https://doi.org/10.1007/s00373-023-02730-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-023-02730-z