The Micro-world of Cographs

DOI10.1007/978-3-030-48966-3_3MaRDI QIDQ5041177zbMATH OpenOpenAlexFDO

Authors Bogdan Alecu, Dominique De Werra, Vadim Lozin

Publication date 13 October 2022

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-48966-3_3

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Recommendations

• The micro-world of cographs
• scientific article; zbMATH DE number 3896983
• Some properties of the clique graph of a cograph
• Structural characterization and decomposition for cographs-(2, 1) and (1, 2): a natural generalization of threshold graphs
• Cographs whose complements consist of k-partite components

Cites work

• (Nearly-)tight bounds on the contiguity and linearity of cographs
• Achromatic number is NP-complete for cographs and interval graphs
• Algorithmic meta-theorems for restrictions of treewidth
• Bipartite dimensions and bipartite degrees of graphs
• Chromatic number versus chromatic number in graphs with bounded clique number
• Graph Classes: A Survey
• Graph parameters and Ramsey theory
• Graph Theory and Probability
• scientific article; zbMATH DE number 7029306 (Why is no real title available?)
• scientific article; zbMATH DE number 3307331 (Why is no real title available?)
• Induced subgraphs and well‐quasi‐ordering
• Letter graphs and well-quasi-order by induced subgraphs
• Linear clique-width for hereditary classes of cographs
• Linear time algorithm for computing a small biclique in graphs without long induced paths
• New results on maximum induced matchings in bipartite graphs and beyond
• Quasi-threshold graphs
• The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
• Threshold graphs and related topics
• Trivially perfect graphs
• Well‐quasi‐ordering and finite distinguishing number

Cited in

(6)

• Letter graphs and modular decomposition
• Letter graphs and geometric grid classes of permutations
• On the Lettericity of Paths
• Critical properties of bipartite permutation graphs
• Bounds on the lettericity of graphs
• The micro-world of cographs

This page was built for publication: The Micro-world of Cographs

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