Generalizing cographs to 2-cographs

DOI10.37236/10272OpenAlexW3134671113MaRDI QIDQ2111769FDOQ2111769

Jagdeep Singh, James 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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

induced subgraphminorcomplementcograph

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

Cites Work

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

Cited In (2)

• Generalizing Cographs to 2-Cographs
• Cographs and 1-sums

Uses Software

• nauty
• SageMath
• Traces

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

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