scientific article; zbMATH DE number 4206028
From MaRDI portal
Publication:3355252
Recommendations
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
- Linear time recognition of P₄-indifference graphs
- Recognizing P₄ -Sparse Graphs in Linear Time
- Recognition algorithm for P₄-tidy graphs
- scientific article; zbMATH DE number 1953107
- A Fully Dynamic Algorithm for the Recognition of P 4-Sparse Graphs
- A fully dynamic algorithm for the recognition of P₄-sparse graphs
- On the recognition of \(P_4\)-indifferent graphs
- scientific article; zbMATH DE number 2119686
- scientific article; zbMATH DE number 2081001
Cited in
(14)- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs
- On semi-\(P_ 4\)-sparse graphs
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs
- Recognizing generalized Petersen graphs in linear time
- Linear time recognition of P₄-indifference graphs
- P4-Reducible Graphs-Class of Uniquely Tree-Representable Graphs
- Recognizing P₄ -Sparse Graphs in Linear Time
- scientific article; zbMATH DE number 2081001 (Why is no real title available?)
- Efficiently recognizing the P₄-structure of trees and of bipartite graphs without short cycles
- On the recognition of \(P_4\)-indifferent graphs
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3355252)
