The Micro-world of Cographs
From MaRDI portal
Publication:5041177
DOI10.1007/978-3-030-48966-3_3OpenAlexW3028658449MaRDI QIDQ5041177
Dominique de Werra, Bogdan Alecu, Vadim V. 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
Related Items (5)
The micro-world of cographs ⋮ Letter Graphs and Geometric Grid Classes of Permutations ⋮ Critical properties of bipartite permutation graphs ⋮ On the Lettericity of Paths ⋮ Letter graphs and modular decomposition
Cites Work
- Unnamed Item
- Unnamed Item
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Bipartite dimensions and bipartite degrees of graphs
- Trivially perfect graphs
- Letter graphs and well-quasi-order by induced subgraphs
- Graph parameters and Ramsey theory
- Algorithmic meta-theorems for restrictions of treewidth
- Achromatic number is NP-complete for cographs and interval graphs
- Threshold graphs and related topics
- Quasi-threshold graphs
- New results on maximum induced matchings in bipartite graphs and beyond
- Chromatic number versus chromatic number in graphs with bounded clique number
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
- Linear Clique‐Width for Hereditary Classes of Cographs
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- Graph Theory and Probability
- Graph Classes: A Survey
- Well‐quasi‐ordering and finite distinguishing number
- Induced subgraphs and well‐quasi‐ordering
This page was built for publication: The Micro-world of Cographs