P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(49)- Representation of graphs by OBDDs
- The graph sandwich problem for P₄-sparse graphs
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- Triangulating graphs with few \(P_4\)'s
- A fast parallel algorithm to recognize P4-sparse graphs
- On extended P₄-reducible and extended P₄-sparse graphs
- On the structure of graphs with few P₄s
- Tree-like P₄-connected graphs
- Total dominating sequences in trees, split graphs, and under modular decomposition
- \(b\)-coloring of tight graphs
- A simple linear time algorithm for cograph recognition
- Linear-time modular decomposition of directed graphs
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Isomorphism of chordal (6, 3) graphs
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- An optimal path cover algorithm for cographs
- \(N\)-extendible posets, and how to minimize total weighted completion time
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- On the \(P_4\)-components of graphs
- Hitting subgraphs in \(P_4\)-tidy graphs
- From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats
- Laplacian integrality in \(P_4\)-sparse and \(P_4\)-extendible graphs
- Recognizing well covered graphs of families with special \(P _{4}\)-components
- Classes of perfect graphs
- The clique operator on graphs with few \(P_{4}\)'s
- scientific article; zbMATH DE number 2127724 (Why is no real title available?)
- Bull-Reducible Berge Graphs are Perfect
- A representation for the modular-pairs of a P4-reducible graph by modular decomposition
- scientific article; zbMATH DE number 4139767 (Why is no real title available?)
- Path-bicolorable graphs. (Extended abstract)
- On atomic structure of \(P_5\)-free subclasses and maximum weight independent set problem
- The perfection and recognition of bull-reducible Berge graphs
- scientific article; zbMATH DE number 6963897 (Why is no real title available?)
- Some results on the reconstruction problems. p‐claw‐free, chordal, and p4‐reducible graphs
- On the clique-width of graph with few \(P_{4}\)'s
- On the isomorphism of graphs with few P4s
- Partitioning P₄-tidy graphs into a stable set and a forest
- On the \(b\)-coloring of \(P_{4}\)-tidy graphs
- Resolving prime modules: the structure of pseudo-cographs and galled-tree explainable graphs
- Characterization and recognition of \(P_{4}\)-sparse graphs partitionable into \(k\) independent sets and \(\ell \) cliques
- A new characterization of P₄-connected graphs
- Path-bicolorable graphs
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Graph classes with few P₄'s: universality and Brownian graphon limits
- Minimal separators in \(P_4\)-sparse graphs
- On bipartite graphs with weak density of some subgraphs
- Spiders can be recognized by counting their legs
This page was built for publication: P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3476849)
