Generalizing cographs to 2-cographs

DOI10.37236/10272OpenAlexW3134671113MaRDI QIDQ2111769

Jagdeep Singh, James G. Oxley

Publication date: 17 January 2023

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.00403

zbMATH Keywords

minorinduced subgraphcomplementcograph

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (1)

Cographs and 1-sums

Uses Software

• nauty
• SageMath
• Traces

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The strong perfect graph theorem
• Complement reducible graphs
• On a class of posets and the corresponding comparability graphs
• A graph and its complement with specified properties. I: Connectivity
• The rank of a cograph
• Practical graph isomorphism. II.
• On a property of the class of n-colorable graphs
• A Linear Recognition Algorithm for Cographs
• On Connectivity in Matroids and Graphs
• On induced subgraphs of a block

This page was built for publication: Generalizing cographs to 2-cographs