The following pages link to (Q4414511):
Displaying 12 items.
- A simple linear time certifying LBFS-based algorithm for recognizing trivially perfect graphs and their complements (Q963386) (← links)
- \(P_ 4\)-comparability graphs (Q1121924) (← links)
- Even and odd pairs in comparability and in \(P_4\)-comparability graphs (Q1283809) (← links)
- Recognizing the \(P_4\)-structure of bipartite graphs (Q1296570) (← links)
- Algorithms for \(P_4\)-comparability graph recognition and acyclic \(P_4\)-transitive orientation (Q1882629) (← links)
- On the \(P_4\)-components of graphs (Q1971221) (← links)
- Recognizing well covered graphs of families with special \(P _{4}\)-components (Q2376085) (← links)
- A characterization of \(P_{4}\)-comparability graphs (Q2433707) (← links)
- Linear time recognition of \(P_4\)-indifference graphs (Q2752464) (← links)
- (Q3355252) (← links)
- (Q4474099) (← links)
- Efficiently recognizing the \(P_4\)-structure of trees and of bipartite graphs without short cycles (Q5935599) (← links)
