The micro-world of cographs
From MaRDI portal
Publication:831855
DOI10.1016/j.dam.2021.11.004zbMath1485.05154OpenAlexW3217790010MaRDI QIDQ831855
Dominique de Werra, Bogdan Alecu, Vadim V. Lozin
Publication date: 24 March 2022
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2021.11.004
Partial orders, general (06A06) Structural characterization of families of graphs (05C75) Graph theory (05C99)
Related Items (3)
Deciding atomicity of subword-closed languages ⋮ The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements ⋮ Graph parameters, implicit representations and factorial properties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- (Nearly-)tight bounds on the contiguity and linearity of cographs
- Edge contractions in subclasses of chordal graphs
- Boxicity and topological invariants
- Graph minors. XX: Wagner's conjecture
- On the rank of a cograph
- NP-completeness results for some problems on subclasses of bipartite and chordal graphs
- Bipartite dimensions and bipartite degrees of graphs
- Complement reducible graphs
- Trivially perfect graphs
- Letter graphs and well-quasi-order by induced subgraphs
- Bi-complement reducible graphs
- On the structure of graphs with few \(P_4\)s
- Graph parameters and Ramsey theory
- Algorithmic meta-theorems for restrictions of treewidth
- Graph minor hierarchies
- 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
- The fault-tolerant metric dimension of cographs
- Cographs: eigenvalues and Dilworth number
- Finiteness theorems in stochastic integer programming
- Factoring and recognition of read-once functions using cographs and normality and the readability of functions associated with partial \(k\)-trees
- On Fraissé's order type conjecture
- Chromatic number versus chromatic number in graphs with bounded clique number
- Geometric grid classes of permutations
- Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths
- Linear Clique‐Width for Hereditary Classes of Cographs
- Subclasses of the separable permutations
- The h-Index of a Graph and its Application to Dynamic Subgraph Statistics
- Graph Theory and Probability
- Defining and identifying cograph communities in complex networks
- On the entropy values of hereditary classes of graphs
- Well-quasi-orderings and sets of finite sequences
- Graph Classes: A Survey
- The Micro-world of Cographs
- Well‐quasi‐ordering and finite distinguishing number
- Better bounds for poset dimension and boxicity
- Induced subgraphs and well‐quasi‐ordering
- Sur l'extension aux relations de quelques propriétés des ordres
- Partial well‐ordering of sets of vectors
- Letter graphs and geometric grid classes of permutations: characterization and recognition
This page was built for publication: The micro-world of cographs
