The following pages link to (Q3355252):
Displaying 14 items.
- A linear-time recognition algorithm for \(P_{4}\)-reducible graphs (Q673108) (← links)
- On a unique tree representation for \(P_ 4\)-extendible graphs (Q1182318) (← links)
- A tree representation for \(P_ 4\)-sparse graphs (Q1183332) (← links)
- A decomposition for a class of \((P_ 5,\overline{P}_ 5)\)-free graphs (Q1309452) (← links)
- On semi-\(P_ 4\)-sparse graphs (Q1356751) (← links)
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation (Q1882629) (← links)
- Recognition and isomorphism of tree-like \(P_4\)-connected graphs (Q1962050) (← links)
- Recognizing generalized Petersen graphs in linear time (Q2192132) (← links)
- Linear time recognition of \(P_4\)-indifference graphs (Q2752464) (← links)
- <i>P</i><sub>4</sub>-Reducible Graphs-Class of Uniquely Tree-Representable Graphs (Q3476849) (← links)
- Recognizing $P_4 $-Sparse Graphs in Linear Time (Q3990660) (← links)
- (Q4474099) (← links)
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles (Q5935599) (← links)
- On the recognition of \(P_4\)-indifferent graphs (Q5946757) (← links)
